Skip to main content
SpringerLink
Log in

On Covering Radius and Discrete Chebyshev Polynomials

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

 We derive a new upper bound on the covering radius of a code as a function of its dual distance. This bound improves on the Honkala-Litsyn-Tietäväinen bound and in a certain interval it is also better than Tietäväinen’s bound. Upper bounds on even-weight codes are considered as well.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, Fin-20014 Turku, Finland, , , , , , FI

    I. Honkala & T. Laihonen

  2. Department of Electrical Engineering-Systems, Tel-Aviv University, Ramat-Aviv, 69978, Israel, , , , , , IL

    S. Litsyn

Authors
  1. I. Honkala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Laihonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Litsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: November 4, 1996; revised version: February 1, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Honkala, I., Laihonen, T. & Litsyn, S. On Covering Radius and Discrete Chebyshev Polynomials. AAECC 8, 395–401 (1997). https://doi.org/10.1007/s002000050077

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050077

Search

Navigation