On Upper Bounds for Unrestricted Binary Error-Correcting Codes

IEEE Transactions on Information Theory

Volumn 17, Issue 4, 1971, Pages 466-478

  Johnson, Selmer M ^a  

^a RAND CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINART CODES; ERROR-CORRECTING CODES;

INFORMATION THEORY;

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

References (12)

1. S. M. Johnson, “A new upper bound for error-correcting codes,” IRE Trans. Inform. Theory, vol. IT-8, Apr. 1962, pp. 203-207.
2. S. M. Johnson, “Improved asymptotic bounds for error-correcting codes,” IEEE Trans. Inform. Theory, vol, IT-9, July 1963, pp. 198-205.
3. M. Plotkin, “Binary codes with specified minimum distances,” IRE Trans. Inform. Theory, vol. IT-6, Sept. 1960, pp. 445-450.
4. C. E. Shannon, R. G. Gallager, and E. R. Berlekarnp, “Lower bounds to error probability-Part II,” Inform. Contr., vol. 10, May 1967, pp. 448–550.
5. R. Ash, Information Theory. New York: Interscience, 1965, pp. 127–130.
6. A. D. Wyner, “Capabilities of bounded discrepancy decoding,’ Bell Syst. Tech. J., vol. 44, July/Aug. 1965, pp. 1061-1122.
7. R. Hamming, “Error-detecting and error-correctmg codes of finite length,” Bell Syst. Tech. J., vol. 29, Apr. 1959, pp. 147–160.
8. N. Wax, “On upper bounds for error-detecting and error-correcting codes of finite length,” IRE Trans. Inform. Theory, vol. IT-5, Dec. 1959, pp. 168-174.
9. A. W. Nordstrom and J. P. Robinson, “An optimal nonlinear code,” Inform. Contr., vol. 11, Nov./Dec. 1967, pp. 613-616.
10. F. P. Prepporrata, “A class of optimal nonlinear double-error-correcting codes,” Inform. Contr., vol. 13, 1968, pp. 378-400.
11. R. J. McEliece and H. Rumsey, “Sphere packing in the Hamming metric,” Bull. Amer. Math. Soc., Jan.1969, pp. 32-35.
12. S. M. Johnson, “Improved bounds for constant weight codes,” to be published.