New constant weight codes from linear permutation groups

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1623-1630

  Nurmela, Kari J ^b   Kaikkonen, Markku K ^c   Östergård, Patric R J ^a,b,d  

^a IEEE

^b AALTO UNIVERSITY   (Finland)

^c Eindhoven University of Technology ^*  (Finland)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Combinatorial optimization; Constant weight codes; Permutation groups; Tabu search

Indexed keywords

ALGEBRA; ALGORITHMS; CODES (SYMBOLS); OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; CONSTANT WEIGHT CODES; LINEAR PERMUTATION GROUPS; TABU SEARCH;

BINARY CODES;

EID: 0031233345     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623163     Document Type: Article

References (11)

1. A. E. Brouwer, "A few new constant weight codes," IEEE Trans. Inform. Theory, vol. IT-26, p. 366, May 1980.
2. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, "A new table of constant weight codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1334-1380, Nov. 1990.
3. L. E. Dickson, Linear Groups with an Exposition of the Galois Field Theory. New York: Dover, 1958.
4. G. Dueck and T. Scheuer, "Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing," J. Comput. Phys., vol. 90, pp. 161-175, 1990.
5. A. A. El Gamal, L. A. Hemachandra, I. Shperling, and V. K. Wei, "Using simulated annealing to design good codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 116-123, Jan. 1987.
6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
7. F. Glover, "Tabu search-Part I," ORSA J. Comput., vol. 1, pp. 190-206, 1989.
8. M. K. Kaikkonen, "Codes from affine permutation groups," submitted for publication.
9. R. E. Kibler, "Some new constant weight codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 364-365, May 1980.
10. K.-U. Koschnick, "Some new constant weight codes," IEEE Trans. Inform. Theory, vol. 37, pp. 370-371, Mar. 1991.
11. E. S. Kramer and D. M. Mesner, "t-designs on hypergraphs," Discr. Math., vol. 15, pp. 263-296, 1976.