Extremal self-dual [50, 25, 10] codes with automorphisms of order 3 and quasi-symmetric 2-(49, 9,6) designs

Designs, Codes, and Cryptography

Volumn 28, Issue 2, 2003, Pages 163-169

  Bouyuklieva, Stefka ^a   Harada, Masaaki ^b  

^a St Cyril and St Methodius University of Veliko Tarnovo   (Bulgaria)

^b YAMAGATA UNIVERSITY   (Japan)

Author keywords

automorphisms; quasi symmetric design; self dual code

Indexed keywords

EID: 84867927439     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022588407585     Document Type: Article

References (9)

1. J. H. Conway V. Pless N. J. A. Sloane 1979 Self-dual codes over GF(3) and GF(4) of length not exceeding 16 IEEE Trans. Inform. Theory 25 312 322
2. J. H. Conway N. J. A. Sloane 1990 A new upper bound on the minimal distance of self-dual codes IEEE Trans. Inform. Theory 36 1319 1333
3. M. Harada A. Munemasa 2002 A quasi-symmetric 2-(49, 9, 6) design J. Combin. Designs 10 173 179
4. W. C. Huffman 1982 Automorphisms of codes with application to extremal doubly-even codes of length 48 IEEE Trans. Inform. Theory 28 511 521
5. W. C. Huffman V. D. Tonchev 1996 The existence of extremal self-dual [50, 25, 10] codes and quasi-symmetric 2-(49, 9, 6) designs Des. Codes and Cryptogr. 6 97 106
6. A. Munemasa, A classification of singly-even self-dual binary codes of length 32, preprint.
7. V. Pless 1972 A classification of self-orthogonal codes over GF(2 Discrete Math. 3 209 246
8. V. D. Tonchev, Codes, In (C. J. Colbourn and J. H. Dinitz, eds.), The CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton (1996) pp. 517-543.
9. V. Y. Yorgov 1987 A method for constructing inequivalent self-dual codes with applications to length 56 IEEE Trans. Inform. Theory 33 77 82