On covering radius and discrete Chebyshev polynomials
From MaRDI portal
Publication:1360991
DOI10.1007/s002000050077zbMath0886.94021MaRDI 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
covering radius; discrete Chebyshev polynomials; Honkala-Litsyn-Tietäväinen bound; upper bounds on even-weight codes
94B65: Bounds on codes
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
The maximal probability that k‐wise independent bits are all 1, On the covering radius of an unrestricted code as a function of the rate and dual distance, Spectra of Symmetrized Shuffling Operators