Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 1995: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 21–32Cite as

On algebraic methods in covering radius problems

  • Invited Contributions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 948))

Abstract

We discuss how characters of finite fields and exponential sums can be applied to covering radius problems. In particular we study the covering radius of BCH codes, and upper bounds on the covering radius of a code with a given dual distance.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. L. Carlitz and S. Uchiyama, ”Bounds for exponential sums,”-Duke Math. J. 24 (1957) 37–41.

    Google Scholar 

  3. S. D. Cohen, ”The length of primitive BCH codes with minimal covering radius,” preprint.

    Google Scholar 

  4. C. Delorme and P. Solé, Diameter, covering index, covering radius and eigenvalues, Europ. J. Combin. 12 (1991), 95–108.

    Google Scholar 

  5. P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Information and Control 23 (1973), 407–438.

    Google Scholar 

  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

    Google Scholar 

  7. T. Helleseth, ”All binary 3-error-correcting BCH codes of length 2m — 1 have covering radius 5,” IEEE Trans. Inform. Theory 24 (1978), 257–258.

    Google Scholar 

  8. T. Helleseth, On the covering radius of cyclic linear codes and aritheoremetic codes, Discrete Appl. Math. 11 (1985), 157–173.

    Google Scholar 

  9. T. Helleseth, T. Kløve and J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Information Theory 24 (1978), 627–628.

    Google Scholar 

  10. I. Honkala, Y. Kaipainen and A. Tietäväinen, ”Long binary narrow-sense BCH codes are normal,” preprint.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  13. Y. Kaipainen, ”Chow variety,” Licentiate Thesis, University of Turku, 1993 (in Finnish).

    Google Scholar 

  14. S. Lang and A. Weil, ”Number of points of varieties in finite fields,” Amer. J. Math. 76 (1954), 819–827.

    Google Scholar 

  15. F. Levy-dit-Vehel and S. Litsyn, ”More on the covering radius of BCH codes,” preprint.

    Google Scholar 

  16. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison Wesley, 1983.

    Google Scholar 

  17. J. H. van Lint, Introduction to Coding Theory. New York-Heidelberg-Berlin: Springer, 1982.

    Google Scholar 

  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.

    Google Scholar 

  19. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland 1977.

    Google Scholar 

  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.

    Google Scholar 

  21. O. Moreno and C. J. Moreno, ”Constructive elementary approach to the covering radius of long BCH codes,” preprint.

    Google Scholar 

  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.

    Google Scholar 

  23. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach. Berlin: Springer, 1976.

    Google Scholar 

  24. I. E. Shparlinski, Addition to the Russian translation of [8], Kiberneticheskiy sbornik 25 (1985), 82–84 (in Russian).

    Google Scholar 

  25. P. Solé, Asymptotic bounds on the covering radius of binary codes, IEEE Trans. Information Theory 36 (1990), 1470–1472.

    Google Scholar 

  26. P. Solé and K. G. Mehrotra, Generalization of the Norse bounds to codes of higher strength, IEEE Trans. Information Theory 37 (1991), 190–192.

    Google Scholar 

  27. P. Solé and P. Stokes, Covering radius, codimension, and dual-distance width, IEEE Trans. Information Theory 39 (1993), 1195–1203.

    Google Scholar 

  28. G. Szegö, Orthogonal Polynomials, Amer. Math. Soc. Colloq. Publ., v. 23, Providence, RI, 1975.

    Google Scholar 

  29. A. Tietäväinen, ”On the covering radius of long binary BCH codes,” Discrete Appl. Math. 16 (1987), 75–77.

    Google Scholar 

  30. A. Tietäväinen, ”Incomplete sums and two applications of Deligne's result,” Lecture Notes in Mathematics 1352, Berlin: Springer, (1988), 190–205.

    Google Scholar 

  31. A. Tietäväinen, Codes and character sums, Springer Lecture Notes in Computer Science 388 (1989), 3–12.

    Google Scholar 

  32. A. Tietäväinen, ”An asymptotic bound on the covering radii of binary BCH codes,” IEEE Trans. Inform. Theory 36 (1990), 211–213.

    Google Scholar 

  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.

    Google Scholar 

  34. A. Tietäväinen, Covering radius and dual distance, Designs, Codes and Cryptography 1 (1991), 31–46.

    Google Scholar 

  35. S. G. Vladutt 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.

    Google Scholar 

  36. A. Weil, ”On some exponential sums,” Proc. Nat. Ac. Sc. 34 (1948), 204–207.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, 20500, Turku 50, Finland

    I. Honkala & A. Tietäväinen

  2. Department of EE-systems, Tel-Aviv University, 69978, Ramat-Aviv, Israel

    S. Litsyn

Authors
  1. I. Honkala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Litsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Tietäväinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Marc Giusti Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Honkala, I., Litsyn, S., Tietäväinen, A. (1995). On algebraic methods in covering radius problems. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-60114-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60114-2

  • Online ISBN: 978-3-540-49440-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation