• DocumentCode
    3060273
  • Title

    Covering radius and discrete Chebyshev polynomials

  • Author

    Honkala, I. ; Laihonen, T. ; Litsyn, S.

  • Author_Institution
    Dept. of Math., Turku Univ., Finland
  • fYear
    1997
  • fDate
    29 Jun-4 Jul 1997
  • Firstpage
    365
  • 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 bound proved previously (Honkala et al., 1995) and in a certain interval it is also better than Tietavainen´s bound
  • Keywords
    dual codes; linear codes; polynomials; Tietavainen´s bound; code; covering radius; discrete Chebyshev polynomials; dual distance; upper bound; Chebyshev approximation; Computer science; Data compression; Decoding; Error correction codes; Hydrogen; Linear code; Mathematics; Polynomials; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
  • Conference_Location
    Ulm
  • Print_ISBN
    0-7803-3956-8
  • Type

    conf

  • DOI
    10.1109/ISIT.1997.613300
  • Filename
    613300
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3060273