Covering radius and discrete Chebyshev polynomials

I. Honkala; T. Laihonen; S. Litsyn

doi:10.1109/ISIT.1997.613300

Covering radius and discrete Chebyshev polynomials

I. Honkala^*, T. Laihonen, S. Litsyn

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages	365
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1997.613300
State	Published - 1997
Event	1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997

Publication series

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

Conference

Conference	1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/Territory	Germany
City	Ulm
Period	29/06/97 → 4/07/97

Access to Document

10.1109/ISIT.1997.613300

Cite this

@inproceedings{02871a9820fe427db07795933d2d38fe,

title = "Covering radius and discrete Chebyshev polynomials",

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{\"a}v{\"a}inen's bound.",

author = "I. Honkala and T. Laihonen and S. Litsyn",

year = "1997",

doi = "10.1109/ISIT.1997.613300",

language = "אנגלית",

isbn = "0780339568",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "365",

booktitle = "Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997",

note = "1997 IEEE International Symposium on Information Theory, ISIT 1997 ; Conference date: 29-06-1997 Through 04-07-1997",

}

Honkala, I, Laihonen, T & Litsyn, S 1997, Covering radius and discrete Chebyshev polynomials. in Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997., 613300, IEEE International Symposium on Information Theory - Proceedings, pp. 365, 1997 IEEE International Symposium on Information Theory, ISIT 1997, Ulm, Germany, 29/06/97. https://doi.org/10.1109/ISIT.1997.613300

TY - GEN

T1 - Covering radius and discrete Chebyshev polynomials

AU - Honkala, I.

AU - Laihonen, T.

AU - Litsyn, S.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030650942&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1997.613300

DO - 10.1109/ISIT.1997.613300

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0030650942

SN - 0780339568

SN - 9780780339569

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 365

BT - Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997

T2 - 1997 IEEE International Symposium on Information Theory, ISIT 1997

Y2 - 29 June 1997 through 4 July 1997

ER -

Covering radius and discrete Chebyshev polynomials

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this