An Updated Table of Minimum-Distance Bounds for Binary Linear Codes

IEEE Transactions on Information Theory

Volumn 39, Issue 2, 1993, Pages 662-677

  Brouwer, A E ^a   Verhoeff, Tom ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Binary linear codes; lower and upper bounds on minimum distance

Indexed keywords

BINARY SEQUENCES;

BINARY CODES; MINIMUM DISTANCE BOUNDS;

CODES (SYMBOLS);

EID: 0027555114     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.212301     Document Type: Article

References (74)

1. W. O. Alltop, “Binary codes with improved minimum weights,” IEEE Trans. inform. Theory, vol. IT-22, pp. 241–243, Mar. 1976. {Al}
2. W. O. Alltop “A method for extending binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 871–872, Nov. 1984. {Al2}
3. L. D. Baumert and R. J. McEliece, “A note on the Griesmer bound,” IEEE Trans. Inform. Theory, vol. IT-19, 134–135, Jan. 1973, {BM}
4. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968. {O, S}
5. D. Berntzen, B. Groneick, S. Grosse, P. Kemper, W. Scharlau, D. Schomaker and M. Wirtz, “New binary codes,” preliminary rep. July 1992. {G G}
6. A. E. Brouwer, “The linear programming bound for binary linear codes,” IEEE Trans. Inform. Theory, submitted, Mar. 1992 {AEB}
7. H. T. Cao, R. L. Dougherty, and H. Janwa, “A [55, 16, 19J binary Goppa code and related codes having large minimum distance,” IEEE Trans. Inform. Theory, vol. 37, 1432, Sept. 1991. {Cal}
8. C. L. Chen, “Computer results on the minimum distance of some binary cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 359–360, May 1970. {N}
9. Y. Cheng, “New linear codes constructed by concatenating, extending, and shortening methods,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 719–721, Sept. 1987. {Ch}
10. Y. Cheng and N. J. A. Sloane, “Codes from symmetry groups,” SIAM J. Discrete Math., vol. 2, pp. 28–37, 1989. {CS}
11. J. H. Conway, S. J. Lomonaco Jr., and N. J. A. Sloane, “A [45, 131 code with minimal distance 16,” Discrete Math., vol. 83, pp. 213–217, 1990. {CLS}
12. R. N. Daskalov and S. N. Kapralov, “New minimum distance bounds for certain binary linear codes,” IEEE Trans. Inform. Theory, vol. 38, p p. 1795–1796, Nov. 1992. {DK}
13. R. N. Daskalov, “There is no binary linear [66, 13, 2 8] code,” preprint, May 1992. {Das}
14. S. M. Dodunekov, S. B. Encheva, and A. I. Ivanov, “New bounds on the minimum length of binary linear block codes,” Rep. LiTH-ISY-I-1283, Linkoping Univ., Sweden, Nov. 1991. {DEl}
15. S. M. Dodunekov, T. Helleseth, N. Manev, and O. Ytrehus, “New bounds on binary linear codes of dimension eight,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 917–919, Nov. 1987. {DI-I}
16. S. M. Dodunekov and N. L. Manev, “An improvement of the Griesmer bound for some small minimum distances,” Discrete Appl. Math., vol. 12, pp. 103–114, Oct. 1985. {DM}
17. R. Dougherty and H. Janwa, “Covering radius computations for binary cyclic codes,” Math. Comput., vol. 57, pp. 415–434, July 1991. {DJ}
18. A. B. Fontaine and W. W. Peterson, “Group code equivalence and optimum codes,” IRE Trans. Inform. Theory (Spec. Suppl.), vol. IT-5, pp. 60–70, May 1959. {FP}
19. B. Groneick and S. Grosse, private communications, July—Sept. 1992. {GG, GG1}
20. J. H. Griesmer, “A bound for error-correcting codes,” IBM J. Res. Develop., vol. 4, pp. 532–542, 1960. {E, Gr}
21. P. P. Greenough and R. Hill, “Optimal linear codes over GF(4),”. Discrete Math., to appear. {Q}
22. A. Gulliver and V. K. Bhargava, “Nine good rate (Iv - 1)/pro qua-sicyclic sicyclic codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 1366–1369, 1992. {GB2}
23. T. A. Gulliver and V. K. Bhargava, “Some best rate lip and r at e (p — 1)/p systematic quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. 37, 552–555, 1991. {GuB}
24. A. A. Hashim and V. S. Pozdniakov, “Computerized search for linear binary codes,” Electron Lett., vol. 12, pp. 350–351, July 1976. {HP}
25. H. J. Helgert and R. D. Stinaff, “Minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 344–356, May 1973. {A, 8}
26. H. J. Helgert and R. D. Stinaff, “Shortened BCH codes,” IEEE Trans. Inform. Theory, vol. IT-19, p p. 818–820, Nov. 1973. {X}
27. H. J. Helgert, “Alternant codes,” Inform. Contr., vol. 26, pp. 369–380, Dec. 1974. {lig}
28. T. Helleseth and O. Ytrehus, “How to find a [33, 8, 14]—code,” in Informatics, (preliminary version), Dept. of Informatics, Univ. of Bergen, Norway, Nov. 1989. {1-1Y2}
29. R. Hill and K. L. Traynor, “The nonexistence of certain binary linear codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 917–922, July 1990. {HT}
30. J. M. Jensen, “The concatenated structure of cyclic and Abelian codes,” IEEE Trnas. Inform. Theory, vol. IT-31, pp. 788–793, Nov. 1985. {Je}
31. S. M. Johnson, “A new upper bound for error-correcting codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 203–207, Apr. 1962. {Jol}
32. S. M. Johnson, “On upper bounds for unrestricted binary error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT47, pp. 466–478, July 1971. {Jo2}
33. M. Karlin, “New binary coding results by circulants,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 81–92, Jan. 1969. {L}
34. M. Kasahara, Y. Sugiyama, S. Hirasawa, and T. Namekawa, “A new class of binary codes constructed on the basis of BCH codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 582–585, Sept. 1975. {Ka}
35. T. Kasami, S. Lin, and W. W. Peterson, “Polynomial codes,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 807–814, Nov. 1968. {V}
36. T. Kasami and N. Tokura, “Some remarks on BCH bounds and minimum weights of binary primitive BCH codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 408–413, May 1969. {BCH}
37. F. R. Kschischang and S. Pasupathy, “Some ternary and quaternary codes and associated sphere packings,” IEEE Trans. Inform. Theory, vol. 38, 227–246, Mar. 1992. {Q, TO3}
38. M. Loeloeian and J. Conan, “A [55, 16, 19] binary Goppa code,” IEEE Trans, Inform. Theory, vol. IT-30, p. 773, Sept. 1984. {LC}
39. V. N. Logacev, “An improvement of the Griesmer bound in the case of small code distances,” in Optimization Methods and Their Applications, All-Union Summer Sem., Khakusy, Lake Baikal, 1972 (Russian), 182 Sibirsk. Erierget. Inst., Sibirsk. Otdel. Akad. Nauk SSSR, Irkutsk, pp. 107–111, 1974. {Lv}
40. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977. {A, B, C, D, E, G, P1, P2, P3, P4, Y1}
41. W. W. Peterson, Error-Correcting Codes. Cambridge, MA: MIT Press, 1961. {BCH}
42. P. Piret, “Good block codes derived from cyclic codes,” Electron. Lett., vol. 10, 391–392, 1974. {Pi}
43. P. Piret, “Good linear codes of lengths 27 and 28,” IEEE Trans. Inform. Theory, vol. 1T-26, p. 227, Mar. 1980. {F312}
44. G. Promhouse and S. Tavares, “The minimum distance of all binary cyclic codes of odd lengths from 69 to 99,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 438–442, July 1978. {PT}
45. C. L. M. van Pul, “On bounds on codes,” Master’s thesis, Dept. of Math. and Comput. Sci., Eindhoven Univ. of Technol., Eindhoven, The Netherlands, Aug. 1982. {Pu}
46. C. L. M. van Pul, “[26, 13, 8] does not exist,” private communication, 1985. {Pu2}
47. V. V. Rao and S. M. Reddy, “A (48, 31, 8) linear code,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 709–711, Sept. 1973. {RR}
48. G. Roelofsen, “On Goppa and generalized Srivastava codes,” Master’s thesis, Dept. of Math. and Comp. Sci., Eindhoven Univ. of Technol., Eindhoven, The Netherlands, Aug. 1982. {Ro}
49. D. Schomaker and M. Wirtz, “On binary cyclic codes of length from 101 to 127,” IEEE Trans. Inform. Theory, vol. 38, pp. 516–518, Mar. 1992. {SW}
50. J. B. Shearer, private communications, June 1988 and Mar. 1992. {Sh, Sh2}
51. J. Simonis, “Binary even [25, 15, 6] codes do not exist,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 151–153, Jan. 1987. {Si}
52. N. J. A. Sloane, D. S. Whitehead, “New family of single-error correcting codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 717–719, Nov. 1970. {D}
53. N. J. A. Sloane, S. M. Reddy, and C. L. Chen, “New binary codes,” IEEE Trans. Inform. Theory, vol. IT-18, 503–510, July 1972. {SRC, Y1}
54. G. Solomon and J. J. Slither, “Algebraically punctured cyclic codes,” Inform. Contr., vol. 8, pp. 170–179, Apr. 1965. {SS}.
55. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “Further results on Goppa codes and their applications to constructing efficient binary codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 518–526, Sept. 1976. {Su}
56. H. C. A. van Tilborg, “On quasi-cyclic codes with rate 1 nt,” IEEE Trans. Inform. Theory, vol. IT-24, 628–630, Sept. 1978. {vT1}
57. H. C. A. van Tilborg, “On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound,” Inform. Contr., vol. 44, pp. 16–35, Jan. 1980. {vT2}
58. H. C. A. van Tilborg, “The smallest length of binary 7-dimensional linear codes with prescribed minimum distance,” Discrete Math., vol. 33, pp. 197–207, 1981. {vT3}
59. H. C. A. van Tilborg, “A proof of the nonexistence of a binary (55, 7, 26) code,” Th-Report Report 79—WSK-09, Tech. Hogeschool Eindhoven, Nov. 1979. {vT4}
60. L. M. G. M. Tolhuizen, “On the optimal use and the construction of linear block codes,” Master’s thesis, Dept. of Math. and Comput. Sci., Eindhoven Univ. of Technol., Eindhoven, The Netherlands, Nov. 1986. {TO}
61. L. M. G. M. Tolhuizen, “New binary linear block codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 727–729, Sept. 1987. {Tol}
62. L. M. G. M. Tolhuizen, “Two new binary codes obtained by shortening a generalized concatenated code,” IEEE Trans. Inform. Theory, vol. 37, p. 1705, Nov. 1991. {T-02}
63. L. M. G. M. Tolhuizen, “A [96 22, 32] code constructed using a 4-ary [24, 5, 16] code found by Hill and Lizak”, private communication, Sept. 1992.
64. T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 665–680. Sept. 1987.
65. T. J. Wagner. “A remark concerning the minimum distance of binary group codes,” IEEE Trans. Inform. Theory, vol. IT-11, p. 458, July 1965. {VVa}
66. L. Weng, “Concatenated codes with large minimum distance,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 613–615. Sept. 1977. {We}
67. M. Wirtz, private communication, May 1988. {VVz}
68. M. Wirtz, private communication via B. Groneick, July 1992. {VVz2}
69. J. A. Wiseman “New binary codes constructed by an old technique,” IEEE IEEE Trans. Inform. Theory, vol. IT-29, pp. 936–937, Nov. 1983. {Wi}
70. J. A. Wiseman, “New binary codes from a generalization of Zinoviev’s technique,” Inform. Comput., vol. 98, pp. 132–139, 1992. {VVi2}
71. O. Ytrehus and T. Helleseth, “There is no binary [25, 8, 10J code,” IEEE Trans. Inform. Theory, vol. 36, pp. 695–696, May 1990. {Y1-11}
72. V. A. Zinoviev, “Generalized cascade codes,” Probl. Peredach. Inform., vol. 12, no. I, pp. 5–15 (English translation: pp. 2–9), Jan.—Mar. 1976. {Zv}
73. V. A. Zinoviev and S. N. Litsyn, “Methods of code lengthening, ”Probl. Probl. Peredach. Inform., vol. 18, no. 4, pp. 29–42 (English translation: pp. 244–254), Oct.—Dec. 1982. IZLI
74. P. Fark8 and K. Briihl, “Three best binary block codes of minimum distance fifteen,” preprint, 1993. {FB}