On covering radius and discrete Chebyshev polynomials

Applicable Algebra in Engineering, Communications and Computing

Volumn 8, Issue 5, 1997, Pages 395-401

  Honkala, I ^a   Laihonen, T ^a   Litsyn, S ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Code; Covering radius; Discrete Chebyshev polynomials; Dual distance

Indexed keywords

BINARY CODES; BINARY SEQUENCES; CHEBYSHEV APPROXIMATION;

COVERING RADIUS; DISCRETE CHEBYSHEV POLYNOMIALS; DUAL DISTANCE;

POLYNOMIALS;

EID: 0030688359     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050077     Document Type: Article

References (19)

1. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. Amsterdam: Elsevier 1997
2. Delorme, C., Solé, P.: Diameter, covering index, covering radius and eigenvalues. Europ. J. Combin. 12, 95-108 (1991)
3. Delsarte, P.: Four fundamental parameters of a code and their combinatorial significance. Inform. Control 23, 407-438 (1973)
4. Helleseth, T.: On the covering radius of cyclic linear codes and arithmetic codes. Discrete Appl. Math. 11, 157-173 (1985)
5. Helleseth, T., Kløve, T., Mykkeltveit, J.: On the covering radius of binary codes. IEEE Trans. Inform. Theory 24, 627-628 (1978)
6. Honkala, I., Litsyn, S., Tietäväinen, A.: On algebraic methods in covering radius problems. In: Cohen, G., Giusti, M., Mora, T. (eds.) Applied algebra, algebraic algorithms and error-correcting codes. Lecture Notes in Computer Science. Vol 948. Berlin Heidelberg New York: Springer 1995
7. Honkala, I., Tietäväinen, A.: Codes and number theory. In: R. A. Brualdi, W. C. Huffman, V. S. Pless (eds.) Handbook of Coding Theory. To appear
8. Laihonen, T., Litsyn, S.: On upper bounds for minimum distance and covering radius of non-binary codes. Submitted
9. van Lint, J.: Introduction to coding theory. Berlin Heidelberg New York: Springer 1982
10. Litsyn, S., Tietäväinen, A.: Upper bounds on the covering radius of a code with a given dual distance. Europ. J. Combin. 173, 265-270 (1996)
11. MacWilliams, F., Sloane, N.: The theory of error-correcting codes. Amsterdam: North-Holland 1977
12. Milne, W.: Numerical calculus. Princeton, New Jersey: Princeton University Press 1949
13. Solé, P.: Asymptotic bounds on the covering radius of binary codes. IEEE Trans. Inform. Theory 36, 1470-1472 (1990)
14. Solé, P., Mehrotra, K.: Generalization of the Norse bounds to codes of higher strength. IEEE Trans. Inform. Theory 37, 190-192 (1991)
15. Solé, P., Stokes, P.: Covering radius, codimension, and dual-distance width. IEEE Trans. Inform. Theory 39, 1195-1203 (1993)
16. Szegö, G.: Orthogonal Polynomials. Colloquium Publications, vol. 23, New York: American Math. Soc. (1959)
17. Tietäväinen, A.: Codes and character sums. Lecture Notes in Computer Science, vol. 388, pp. 3-12. Berlin Heidelberg New York: Springer 1989
18. Tietäväinen, A.: An upper bound on the covering radius as a function of its dual distance. IEEE Trans. Inform. Theory 36, 1472-1474 (1990)
19. Tietäväinen, A.: Covering radius and dual distance. Designs, Codes Cryptog. 1, 31-46 (1991)