Optimal binary linear codes of dimension at most seven

Discrete Mathematics

Volumn 226, Issue 1-3, 2001, Pages 51-70

  Bouyukliev, Iliya ^a   Jaffe, David B ^b  

^a INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009017511     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00125-4     Document Type: Article

References (24)

1. B.I. Belov, A conjecture on the Griesmer boundary, in: Optimization Methods and Their Applications (Ail-Union Summer Sem., Khakusy, Lake Baikal, 1972) (Russian), Sibersk. Ènerget. Inst. Sibirsk. Otdel. Akad. Nauk SSSR (Irkutsk), 1974, pp. 100-106, 182.
2. I. Bouyukliev, D.B. Jaffe, V. Vavrek, The smallest length of eight-dimensional binary linear codes with prescribed minimum distance, IEEE Transactions on Information Theory 46 (2000) 1539-1544.
3. A.E. Brouwer, The uniqueness of the binary linear [27, 7, 12] code, accessible over the World Wide Web via http://www.win.tue.nl/̃ aeb/preprints/Unique .27 .7 .12. gz, 1992.
4. A.E. Brouwer, A.M. Cohen, A. Neumaier, Distance-Regular Graphs, Springer, New York, 1989.
5. A.E. Brouwer, M. van Eupen, The correspondence between projective codes and 2-weight codes, Designs Codes Cryptogr. 11 (1997) 261-266.
6. S.M. Dodunekov, The minimum block length of a linear q-ary code with given dimension and code distance, Problemy Peredachi Informatsii 20 (1984) 11-22 (in Russian).
7. S.M. Dodunekov, Optimal linear codes, Ph.D. Thesis, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1985.
8. S.M. Dodunekov, N.L. Manev, Characterization of two classes of codes that attain the Griesmer bound, Problems Inform. Transmission 19 (1983) 253-259.
9. T. Helleseth, Further classifications of codes meeting the Griesmer bound, IEEE Trans. Inform. Theory 30 (1984) 395-403.
10. T. Helleseth, A characterization of codes meeting the Griesmer bound, Inform, and Control 50 (1981) 128-159.
11. T. Helleseth, Projective codes meeting the Griesmer bound, Discrete Math. 106/107 (1992) 265-271.
12. R. Hill, Caps and codes, Discrete Math. 22 (1978) 111-137.
13. D.B. Jaffe, Optimal binary linear codes of length ≤30, Discrete Math. 223 (2000) 135-155.
14. D.B. Jaffe, Binary linear codes: new results on nonexistence, preprint (ongoing work), Version 0.5 (11/10/97), accessible over the World Wide Web via http://www.math.unl.edu/̃djaffe/codes /code.ps.gz or code.dvi.gz; see ̃djaffe/binary/codeform.html for an online database, which is more frequently updated.
15. D.B. Jaffe, in: T. Mora, H. Mattson (Eds.), A Brief Tour of Split Linear Programming, Proceedings of the AAECC 12, Lecture Notes in Computer Science, Vol. 1255, Springer, New York, 1997, pp. 164-173.
16. S.N. Kapralov, Enumeration of the binary linear [24, 7, 10] codes, Proceedings of the Fifth International Workshop on Algebraic and Combinatorial Coding Theory, Unicorn, Shumen, Bulgaria, 1996, pp. 151-156.
17. B.D. McKay, Practical graph isomorphism, Congr. Numer. 30 (1981) 45-87.
18. B.D. Mckay, Nauty user's guide (Version 1.5), 1990, This guide as well as the nauty source files are available over the World Wide Web via http://cs.anu.edu.au/people/bdm/nauty19 /nauty19p.tar.Z.
19. E.M. Rains, N.J.A. Sloane, Self-dual codes, in: V.S. Pless, W.C. Huffman (Eds.), Handbook of Coding Theory, Elsevier Science, Amsterdam, 1998.
20. G. Solomon, J.J. Stiffler, Algebraically punctured cyclic codes, Inform, and Control 8 (1965) 170-179.
21. H. van Tilborg, On quasi-cyclic codes with rate 1/m, IEEE Trans. Inform. Theory 24 (1978) 628-630.
22. H. van Tilborg, On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Inform, and Control 44 (1980) 16-35.
23. H. van Tilborg, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance, Discrete Math. 33 (1981) 197-207.
24. S. Topalova, Construction and investigation of combinatorial designs with given automorphisms, Ph.D. Thesis, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 1998.