On covering radius and discrete Chebyshev polynomials

DOI10.1007/s002000050077zbMath0886.94021OpenAlexW3015017969MaRDI QIDQ1360991

Iiro S. Honkala, Tero Laihonen, Simon N. Litsyn

Publication date: 13 May 1998

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050077

zbMATH Keywords

covering radiusdiscrete Chebyshev polynomialsHonkala-Litsyn-Tietäväinen boundupper bounds on even-weight codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items

On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ The maximal probability that k‐wise independent bits are all 1 ⋮ Spectra of Symmetrized Shuffling Operators