The Uniqueness of the Best Code

IEEE Transactions on Information Theory

Volumn 40, Issue 5, 1994, Pages 1693-1698

  Litsyn, Simon ^a   Vardy, Alexander ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

bounds on the size of a code; constant weight codes; Optimal codes

Indexed keywords

INFORMATION THEORY; NUMERICAL METHODS; OPTIMIZATION; VECTORS;

BOUNDS ON THE SIZE OF A CODE; CODEWORDS; CONSTANT WEIGHT CODES; OPTIMAL CODES;

BINARY CODES;

EID: 0028515617     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.333896     Document Type: Article

References (12)

1. J. L. Allston, R. W. Buskens, and R. G. Stanton, “An examination of the nonisomorphic solutions to a problem of covering designs in fifteen Math. Comput., vol. 4, 189-206, 1988.
2. M. R. Best, “Binary codes with a minimum distance of four,” IEEE Trans. Inform. Theory, vol. 26, pp. 738-742, 1980.
3. 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. 24, pp. 81-93, 1978.
4. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, New York: Springer-Verlag, 1988.
5. J. H. Conway and N. J. A. Sloane, “Quaternary constructions for the binary codes of Julin, Best, and others,” Designs, Codes, Crypto., vol. 4, pp. 31-42, 1994.
6. G. D. Forney, Jr., “Progress in geometrically uniform codes,” in Proc. Sixth Swedish-Russian International Workshop on Information Theory, (Mölle, Sweden), August 1993, pp. 16-20.
7. J.-M. Goethals, “The extended Nadler code is unique,” IEEE Trans. Inform. Theory, vol. 23, pp. 132-135, 1977.
8. D. Julin, “Two improved block codes,” IEEE Trans. Inform. Theory, vol. 11, p. 459, 1965.
9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
10. V. Pless, “On the uniqueness of the Golay codes,” J. Comb. Theory, vol. 5, pp. 215-228, 1968.
11. S. Snover, “The uniqueness of the Nordstrom-Robinson and the Golay binary codes,” Ph.D. thesis, Michigan State Univ., 1973.
12. N. Wax, “On upper bounds for error-detecting and error-correcting codes of finite length,” IEEE Trans. Inform. Theory, vol. 5, pp. 168-174, 1959.