On algebraic methods in covering radius problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 948, Issue , 1995, Pages 21-32

  Honkala, I ^a   Litsyn, S ^b   Tietavainen A ^a  

^a UNIVERSITY OF TURKU   (Finland)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

ALGEBRAIC METHOD; BCH CODE; COVERING RADIUS; DUAL DISTANCE; EXPONENTIAL SUMS; FINITE FIELDS; UPPER BOUND;

ALGEBRA;

EID: 84955605118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (36)

1. E. F. Assmus, Jr. and H. F. Mattson, Jr., "Some 3-error-correcting BCH codes have covering radius 5," IEEE Trans. Inform. Theory 22 (1976), 348-349.
2. L. Carlitz and S. Uchiyama, "Bounds for exponential sums,"-Duke Math. J. 24 (1957) 37-41.
3. S. D. Cohen, "The length of primitive BCH codes with minimal covering radius, " preprint.
4. C. Delorme and P. Sole, Diameter, covering index, covering radius and eigenvalues, Europ. J. Combin. 12 (1991), 95-108.
5. P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Information and Control 23 (1973), 407-438.
6. D. C. Gorenstein, W. W. Peterson and N. Zierler, "Two-error correcting Bose-Chaudhury codes are quasi-perfect," Inform, and Control 3 (1960), 291-294.
7. m-1 have covering radius 5," IEEE Trans. Inform. Theory 24 (1978), 257-258.
8. T. Helleseth, On the covering radius of cyclic linear codes and aritheoremetic codes, Discrete Appl. Math. 11 (1985), 157-173.
9. T. Helleseth, T. Kløve and J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Information Theory 24 (1978), 627-628.
10. I. Honkala, Y. Kaipainen and A. Tietäväinen, "Long binary narrow-sense BCH codes are normal," preprint.
11. I. Honkala and A. Tietäväinen, "Codes and number theory," in: Handbook of Coding Theory, Eds. R. A. Brualdi, W. C. Huffman, and V. S. Pless, to appear.
12. J. A. van der Horst and T. Berger, "Complete decoding of triple-error-correcting binary BCH codes," IEEE Trans. Inform. Theory 22 (1976), 138-147.
13. Y. Kaipainen, "Chow variety," Licentiate Thesis, University of Turku, 1993 (in Finnish).
14. S. Lang and A. Weil, "Number of points of varieties in finite fields," Amer. J. Math. 76 (1954), 819-827.
15. F. Levy-dit-Vehel and S. Litsyn, "More on the covering radius of BCH codes," preprint.
16. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison Wesley, 1983.
17. J. H. van Lint, Introduction to Coding Theory. New York-Heidelberg-Berlin: Springer, 1982.
18. S. Litsyn and A. Tietäväinen, Upper bounds on the covering radius of a code with a given dual distance, Europ. J. Comb., to appear.
19. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland 1977.
20. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr. and L. R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Information Theory 23 (1977), 157-166.
21. O. Moreno and C. J. Moreno, "Constructive elementary approach to the covering radius of long BCH codes," preprint.
22. O. Moreno and C. J. Moreno, "The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes," IEEE Trans. Inform. Theory, to appear.
23. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach. Berlin: Springer, 1976.
24. I. E. Shparlinski, Addition to the Russian translation of [8], Kiberneticheskiy sbornik 25 (1985), 82-84 (in Russian).
25. P. Sole, Asymptotic bounds on the covering radius of binary codes, IEEE Trans. Information Theory 36 (1990), 1470-1472.
26. P. Sole and K. G. Mehrotra, Generalization of the Norse bounds to codes of higher strength, IEEE Trans. Information Theory 37 (1991), 190-192.
27. P. Sole and P. Stokes, Covering radius, codimension, and dual-distance width, IEEE Trans. Information Theory 39 (1993), 1195-1203.
28. G. Szegō, Orthogonal Polynomials, Amer. Math. Soc. Colloq. Publ., v. 23, Providence, RI, 1975.
29. A. Tietäväinen, "On the covering radius of long binary BCH codes," Discrete Appl. Math. 16 (1987), 75-77.
30. A. Tietäväinen, "Incomplete sums and two applications of Deligne's result," Lecture Notes in Mathematics 1352, Berlin: Springer, (1988), 190-205.
31. A. Tietäväinen, Codes and character sums, Springer Lecture Notes in Computer Science 388 (1989), 3-12.
32. A. Tietäväinen, "An asymptotic bound on the covering radii of binary BCH codes," IEEE Trans. Inform. Theory 36 (1990), 211-213.
33. A. Tietäväinen, An upper bound on the covering radius as a function of its dual distance, IEEE Trans. Information Theory 36 (1990), 1472-1474.
34. A. Tietäväinen, Covering radius and dual distance, Designs, Codes and Cryptography 1 (1991), 31-46.
35. S. G. Vlădu and A. N. Skorobogatov, "On the covering radius of long BCH codes," Problemy Peredachi Informacii 25 (1) (1989), 38-45 (in Russian). Translated in Problems of Inform. Transmission 25 (1) (1989), 28-34.
36. A. Weil, "On some exponential sums," Proc. Nat. Ac. Sc. 34 (1948), 204-207.