Covering radius and discrete Chebyshev polynomials

I. Honkala, T. Laihonen, S. Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 Tietäväinen's bound.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages365
Number of pages1
DOIs
StatePublished - 1997
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: 29 Jun 19974 Jul 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/TerritoryGermany
CityUlm
Period29/06/974/07/97

Fingerprint

Dive into the research topics of 'Covering radius and discrete Chebyshev polynomials'. Together they form a unique fingerprint.

Cite this