Bounds for Binary Codes of Length Less Than 25

IEEE Transactions on Information Theory

Volumn 24, Issue 1, 1978, Pages 81-93

  Best, M R ^a   Brouwer, A E ^a   Macwilliams, F Jessie ^b   Odlyzko, Andrew M ^b   Sloane, Neil J A ^b  

^a CWI   (Netherlands)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0017926560     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1978.1055827     Document Type: Article

References (69)

1. W. O. Alltop, personal communication.
2. M. R. Best, “The Wax bound for binary codes,” Math. Centre Report ZW72, Amsterdam, 1976, (Preprint of Section III of this paper.)
3. M. R. Best, and A. E. Brouwer “The triply shortened binary Hamming code is optimal,” Discrete Math., vol. 17, pp. 235–245, 1977.
4. A. E. Brouwer, “A(17,6,4) = 20, or the nonexistence of the scarce design SD(4,1;17,21),” Math. Centre Report ZW62, Amsterdam, 1975.
5. n—the case n ≢ 2 (mod 3),” Math. Centre Report ZW76, Amsterdam, 1976.
6. —, “Some triplewise balanced designs,” Math. Centre Report ZW77, Amsterdam, 1976.
7. 4's),” Math. Centre Report ZW64, Amsterdam, 1976.
8. P. Delsarte “Bounds for unrestricted codes, by linear programming,” Philips Research Reports, vol. 27, pp. 272–289, 1972.
9. —, “An algebraic approach to the association schemes of coding theory,” Philips Research Reports Supplements, no. 10, 1973.
10. —, “The association schemes of coding theory,” in Combinatorics, M. Hall, Jr., and J. H. van Lint, Eds. Amsterdam: Reidel, Dordrecht, and Mathematical Centre, 1975, pp. 143–161.
11. kF(i,k,n),” SIAM J. Appl. Math., vol. 31, pp. 262–270, 1976.
12. P. Delsarte, W. Haemers, and C. Weug, unpublished tables, 1974.
13. R. H. F. Denniston, personal communication.
14. J. Doyen and A. Rosa “A bibliography and survey of Steiner systems,” Bolletino Unione Matematica Italiana, vol. 7, pp. 392–419, 1973.
15. P. J. Eberlein “A two parameter test matrix,” Math. Comp., vol. 18, pp. 296–298, 1964.
16. B. Elspas “A conjecture on binary nongroup codes,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 599–600, Oct. 1965.
17. P. Erdos, and H. Hanani “On a limit theorem in combinatorical analysis,” Publ. Math. Debrecen, vol. 10, pp. 10–13, 1963.
18. W. Feller, An Introduction to Probability Theory and its Applications, vol. 1, 2nd Ed. New York: Wiley, 1960.
19. F. A. Ficken, The Simplex Method of Linear Programming. New York: Holt, Rinehart and Winston, 1961.
20. J. M. Goethals “The extended Nadler code is unique,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 132–135, Jan. 1977.
21. M. J. E. Golay, “Notes on digital coding,” Proc. IRE, vol. 37, p. 657, June 1949.
22. — “Binary Coding,” IEEE Trans. Inform. Theory, vol. IT-4, pp. 23–28, Sept. 1954.
23. R. K. Guy, “A problem of Zarankiewicz,” in Theory of Graphs (Proc. Colloq., Tihany). New York: Academic, 1968, pp. 119–150.
24. W. Hahn “Über Orthogonalpolynome, die q-Differenzen-gleichungen genügen,” Math. Nachr., vol. 2, pp. 4–34, 1949.
25. R. W. Hamming “Error detecting and error correcting codes,” Bell Syst. Tech. J., vol. 29, pp. 147–160, Apr. 1950.
26. H. Hanani “On quadruple systems,” Canad. J. Math., vol. 12, pp. 145–157, 1960.
27. — “The existence and construction of balanced incomplete block designs,” Annals Math. Stat., vol. 32, pp. 361–386, 1961.
28. —, “A balanced incomplete block design,” ibid., vol. 36, p. 711, 1965.
29. — “Balanced incomplete block designs and related designs,” Discrete Math., vol. 11, pp. 255–369, 1975.
30. 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.
31. S. M. Johnson “A new upper bound for error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-8, pp. 203–207, Apr. 1962.
32. — “Improved asymptotic bounds for error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 198–205, July 1963.
33. —, unpublished tables, 1970.
34. — “On upper bounds for unrestricted binary error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 466–478, July 1971.
35. — “Upper bounds for constant weight error-correcting codes,” Discrete Math., vol. 3, pp. 109–124, 1972.
36. D. Julin, “Two improved block codes,” IEEE Trans. Inform. Theory, vol. IT-11, p. 459, July 1965.
37. J. G. Kalbfleisch, and R. G. Stanton “Maximal and minimal coverings of (k − 1)-tuples by k-tuples,” Pacific J. Math., vol. 26, pp. 131–140, 1968.
38. S. Karlin and J. L. McGregor “The Hahn polynomials, formulas and an application,” Scripta Math., vol. 26, pp. 33–46, 1961.
39. T. P. Kirkman “On a problem in combinations,” Cambridge and Dublin Math. J., vol. 2, pp. 191–204, 1847.
40. V. I. Levenshtein “The application of Hadamard matrices to a problem in coding,” Problems of Cybernetics, vol. 5, pp. 166–184, 1964.
41. Shen Lin, personal communication.
42. J. H. van Lint “A new description of the Nadler code,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 825–826, Nov. 1972.
43. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr., and L. R. Welch, unpublished tables, 1972.
44. — “New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157–166, Mar. 1977.
45. N. S. Mendelsohn and S. H. Y. Hung “On the Steiner systems S(3,4,14) and S(4,5,15),” Notices Amer. Math. Soc., vol. 18, pp. 552–553, 1971; Abstract 71T-A78 and p. 792: erratum, and Utilitas Math., vol. 1, pp. 5–95, 1972.
46. M. Nadler, “A 32-point n = 12, d = 5 code,” IEEE Trans. Inform. Theory, vol. IT-8, p. 58, Jan. 1962.
47. A. W. Nordstrom and J. P. Robinson “An optimum nonlinear code,” Info. Control, vol. 11, pp. 613–616, 1967.
48. H. R. Phinney, personal communication.
49. M. Plotkin “Binary codes with specified minimum distances,” IEEE Trans. Inform. Theory, vol. IT-6, pp. 445–450, Sept. 1960.
50. R. A. Rankin “On the closest packing of spheres in n dimensions,” Annals of Math., vol. 48, pp. 1062–1081, 1947.
51. C. A. Rogers, Packing and Covering. Cambridge: Cambridge University Press, 1964.
52. J. Schönheim “On maximal systems of k-tuples,” Stud. Sci. Math. Hungar., vol. 1, pp. 363–368, 1966.
53. M. Simonnard, Linear Programming. Englewood Cliffs, NJ: Prentice-Hall, 1966.
54. N. J. A. Sloane “A survey of constructive coding theory, and a table of binary codes of highest known rate,” Discrete Math., vol. 3, pp. 265–294, 1972.
55. —, “An introduction to association schemes and coding theory,” in Theory and Application of Special Functions, R. Askey, Ed. New York: Academic, 1975, pp. 225–260.
56. N. J. A. Sloane, S. M. Reddy, and C. L. Chen “New binary codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 503–510, July 1972.
57. N. J. A. Sloane and J. J. Seidel “A new family of nonlinear codes obtained from conference matrices,” Annals New York Acad. of Sciences, vol. 175, pp. 363–365, 1970.
58. N. J. A. Sloane and D. S. Whitehead “A new family of single-error correcting codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 717–719, Nov. 1970.
59. D. M. Y. Sommerville, An Introduction to the Geometry of N Dimensions. New York: Dover, 1958.
60. J. Spencer “Maximal consistent families of triples,” J. Combinatorial Theory, vol. 5, pp. 1–8, 1968.
61. R. G. Stanton, J. G. Kalbfleisch, and R. C. Mullin, “Covering and packing designs,” in Proc. 2nd Chapel Hill Conf. Combinatorial Mathematics and its Applications, R. C. Bose et al., Eds., Chapel Hill, NC, 1970, pp. 428–450.
62. R. F. Stevens and W. G. Bouricius, “The heuristic generation of large error-correcting codes,” unpublished memorandum, IBM Research Center, Yorktown Heights, Aug. 1, 1959.
63. D. Stinson, “Determination of a Packing Number,” preprint.
64. J. C. Swift “Quasi-Steiner systems,” Atti Acad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8), vol. 44, pp. 40–44, 1968.
65. W. G. Valiant, “A (14,6,7) < 52 or the nonexistence of a certain constant weight code,” Math. Centre Report ZW71, Amsterdam, 1976.
66. N. Wax “On upper bounds for error detecting and error-correcting codes of finite length,” IEEE Trans. Inform. Theory, vol. IT-5, pp. 168–174, 1959.
67. R. M. Wilson, “The construction of group-divisible designs and partial planes having the maximum number of lines of a given size,” in Proc. 2nd Chapel Hill Conf. Combinatorial Mathematics and its Applications, R. C. Bose et al., Eds., Chapel Hill, NC, 1970, pp. 488–497.
68. — “An existence theory for pairwise balanced designs, I,” J. Combinatorial Theory vol. 13A, pp. 220–245, 1972; “II,” ibid., vol. 13A, pp. 246–273, 1972; “III,” ibid., vol. 18A, pp. 71–79, 1975.
69. E. Witt “Über Steinersche Systeme,” Abh. Math. Sem. Univ. Hamburg, vol. 12, pp. 265–275, 1938.