Upper bounds on the covering radius of a code with a given dual distance
From MaRDI portal
Publication:1911845
DOI10.1006/eujc.1996.0022zbMath0858.94030MaRDI QIDQ1911845
Aimo Tietäväinen, Simon N. Litsyn
Publication date: 25 March 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0022
11T24: Other character sums and Gauss sums
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Eigenvalues, eigenspaces and distances to subsets, On the covering radius of an unrestricted code as a function of the rate and dual distance