Binary Codes with a Minimum Distance of Four

IEEE Transactions on Information Theory

Volumn 26, Issue 6, 1980, Pages 738-742

  Best, M R ^a  

^a NATIONAL AEROSPACE LABORATORY NLR   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (14)

1. M. R. Best, “A[11,4,4]=35 or some new optimal constant weight codes,” Math. Centre, P.O. Box. 4079, 1009 AB, Amsterdam, The Netherlands, Report ZN 71/77, 1977.
2. —, “Binary codes with minimum distance four,” Math. Centre, Report ZW 112/78, 1978.
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. M. R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko and N. J. A. Sloane, “Bounds for binary codes of length less than 25,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 81–93, 1978.
5. P. Delsarte, “Bounds for unrestricted codes, by linear programming,” Philips Res. Reports, vol 27, pp. 272–289, 1972.
6. M. J. E. Golay, “Binary coding,” IRE Trans. Inform. Theory, vol. PGIT-4, pp. 23–38, 1954.
7. S. M. Johnson, “A new upper bound for error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-8, pp. 203–207, 1962.
8. D. Julin, “Two improved block codes,” IEEE Trans. Inform. Theory, vol. IT-11, p. 459, 1965.
9. J. G. Kalbfleish and R. G. Stanton, “Maximal and minimal coverings of (k-1)-tuples by k-tuples,” Pacific J. Math., vol. 26, pp. 131–140, 1968.
10. J. Leech and N. J. A. Sloane, “Sphere packings and error-correcting codes,” Canad. J. Math., vol. 23, pp. 718–745, 1971.
11. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. Amsterdam: North-Holland, 1977.
12. N. J. A. Sloane, “Binary codes, lattices and sphere-packings,” in Combinatorial Surveys, P. J. Cameron, Ed. New York: Academic, 1977, pp. 117–164.
13. 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, 1970.
14. L. R. Welch, R. J. McEliece, and H. C. Rumsey, Jr., “A low-rate improvement of the Elias bound,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 676–678, 1974.