Linear programming bounds for codes of small size

European Journal of Combinatorics

Volumn 18, Issue 6, 1997, Pages 647-656

  Krasikov, Ilia ^a,b   Litsyn, Simon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEIT BERL COLLEGE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30244537928     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0129     Document Type: Article

References (17)

1. J. T. Astola, The Tietäväinen bound for spherical codes, Discr. Appl. Math., 7 (1984), 17-21.
2. P. Boyvalenkov and D. Danev, On linear programming bounds for codes in polynomial metric spaces, preprint, 1996.
3. P. Delsarte, An algebraic approach to association schemes of coding theory, Philips Res. Rep. Suppl., 10 (1973).
4. I. Honkala and A. Tietäväinen, Codes and number theory, in: Handbook of Coding Theory, Elsevier, to be published.
5. S. M. Johnson, A new upper bound for error-correcting codes, IRE Trans. Inform. Theory, 8 (1962), 203-207.
6. V. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, IEEE Trans. Inform. Theory, 41 (1995), 1303-1321.
7. J. H. van Lint, Introduction to Coding Theory, Springer-Verlag, 1992.
8. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes, North-Holland, New York, 1977.
9. R. J. McEliece and H. Rumsey, Jr., Sphere-packing in the Hamming metric, J. Combin. Theory, Ser. A, (1973), 32-34.
10. A. Perttula, Bounds for binary and nonbinary codes slightly outside of the Plotkin range, Tampere University of Technology Publ., 14 (1982).
11. M. Plotkin, Binary codes with specified minimum distance, IRE Trans. Inform. Theory, 6 (1960), 445-450.
12. V. M. Sidel'nikov, On mutual correlation of sequences, Sov. Math. Dokl, 12(1) (1971), 197-201.
13. V. M. Sidel'nikov, On extremal polynomials used to estimate the size of codes, Probl. Inform. Transmission, 16 (1980), 174-186.
14. N. J. A. Sloane and J. J. Seidel, A new family of nonlinear codes obtained from conference matrices, Ann. N.Y. Acad. Sci., 175 (1970), 363-365.
15. G. Szegö, Orthogonal Polynomials, American Mathematical Society Colloquium Publication, vol. 23, Providence, RI, 1975.
16. H. Tarnanen, Upper bounds for constant weight and Lee codes slightly outside the Plotkin range, Disc. Appl. Math., 16 (1987), 265-277.
17. A. Tietäväinen, Bounds for binary codes just outside the Plotkin range, Inform. Control, 47 (1980), 85-93.