Optimal binary linear codes of length ≤ 30

Discrete Mathematics

Volumn 223, Issue 1-3, 2000, Pages 135-155

  Jaffe, David B ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012965097     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00135-1     Document Type: Article

References (31)

1. L.D. Baumert, R.J. McEliece, A note on the Griesmer bound, IEEE Trans. Inform. Theory 19 (1973) 134-135.
2. A.E. Brouwer, The uniqueness of the binary linear [27,7,12] code. Accessible over the World Wide Web via http://www.win.tue.n1/~aeb/preprints/Unique.27.7.12.gz, 1992.
3. A.E. Brouwer, T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory 39 (1993), 662-677. Supplemented by on-line updates: information regarding [n,k,d] codes with fixed n,k is accessible over the World Wide Web via http : //www.win.tue.nl/~aeb/voorlincod.html.
4. Y. Cheng, N.J.A. Sloane, Codes from symmetry groups, and a [32,17,8] code, SIAM J. Discrete Math. 2 (1989) 28-37.
5. S.M. Dodunekov, S.B. Encheva, On the uniqueness of some linear subcodes of the binary extended Golay code, in: Proceedings of the International Workshop on Algebraic and Combinatorial Coding Theory, Varna, Bulgaria, 1988, pp. 38-40.
6. S.M. Dodunekov, S.B. Encheva, Uniqueness of some linear subcodes of the extended binary Golay code, Problems Inform. Transmission 29 (1993) 38-43.
7. S.M. Dodunekov, N.L. Manev, An improvement of the Griesmer bound for some small minimum distances, Discrete Appl. Math. 12 (1985) 103-114.
8. S.B. Encheva, Optimal binary linear codes, Reports in Informatics, University of Bergen, vol. 63, 1992.
9. A.B. Fontaine, W.W. Peterson, Group code equivalence and optimum codes, IEEE Trans. Inform. Theory (Spec. Suppl.) 5 (1959) 60-70.
10. M.J.E. Golay, Notes on digital coding, Proc. IEEE 37 (1949) 657.
11. A.A. Hashim, V.S. Pozdniakov, Computerized search for linear binary codes, Electron. Lett. 12 (1976) 350-351.
12. P.W. Heijnen, Er bestaat geen binaire [33,9,13] code, Afstudeerverslag, T. U. Delft, 1993.
13. T. Helleseth, Ø. Ytrehus, How to find a [33,8,14] code, Reports in Informatics, University of Bergen, vol. 41, 1989.
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, A brief tour of split linear programming, in: T. Mora, H. Mattson (Eds.), Proceedings 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, in: Proceedings of the Fifth International Workshop on Algebraic and Combinatorial Coding Theory, Unicorn, Shumen, Bulgaria, 1996, pp. 151-156.
17. M. Karlin, New binary coding results by circulants, IEEE Trans. Inform. Theory 15 (1969) 81-92.
18. B.K. Kostova, N.L. Manev, A [25,8,10] code does not exist, C. R. Acad. Bulgare Sci. 43 (1990) 41-44.
19. J.H. van Lint, Introduction to Coding Theory, second ed., Springer, New York, 1992.
20. F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
21. P. Piret, Good linear codes of lengths 27 and 28, IEEE Trans. Inform. Theory 26 (1980) 227.
22. J. Simonis, The [23,14,5] Wagner code is unique, Discrete Mathematics, to appear.
23. J. Simonis, Binary even [25,15,6] codes do not exist, IEEE Trans. Inform. Theory 33 (1987) 151-153.
24. J. Simonis, A description of the [16,7,6] codes, Lecture Notes in Computer Science, vol. 508, Springer, Berlin, 1991, pp. 24-35.
25. J. Simonis, Codes and semilinear spaces, in: Combinatorics '90, North-Holland, Amsterdam, 1992.
26. J. Simonis, The [18,9,6] code is unique, Discrete Math. 106/107 (1992) 439-448.
27. S.L. Snover, The uniqueness of the Nordstrom-Robinson and the Golay binary codes, Ph.D. Thesis, Michigan State Univ., 1973.
28. H. van Tilborg, On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Inform. and Control 44 (1980) 16-35.
29. T.J. Wagner, A remark concerning the minimum distance of binary group codes, IEEE Trans. Inform. Theory 11 (1965) 458.
30. Ø. Ytrehus, T. Helleseth, There is no binary [25,8,10] code, IEEE Trans. Inform. Theory 36 (1990) 695-696.
31. G. Solomon, J.J. Stiffler, Algebraically punctured cyclic codes, Inform. and Control 8 (1965) 170-179.