On covering radius and discrete Chebyshev polynomials (Q1360991): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s002000050077 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3015017969 / rank | |||
Normal rank |
Latest revision as of 19:37, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On covering radius and discrete Chebyshev polynomials |
scientific article |
Statements
On covering radius and discrete Chebyshev polynomials (English)
0 references
13 May 1998
0 references
The authors show that using discrete Chebyshev polynomials instead of regular ones they get an improvement on the Honkala-Litsyn-Tietäväinen bound. In a certain interval this new bound is also better than Tietäväinen's bound. Upper bounds on even-weight codes are considered as well. The improvement is based on the fact that the authors are interested in finding a polynomial with small maximum only in the integral points of a certain interval and not in the whole interval.
0 references
covering radius
0 references
upper bounds on even-weight codes
0 references
discrete Chebyshev polynomials
0 references
Honkala-Litsyn-Tietäväinen bound
0 references