Upper bounds on the covering radius of a code with a given dual distance

DOI10.1006/eujc.1996.0022zbMath0858.94030OpenAlexW2062444390MaRDI 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

zbMATH Keywords

upper boundscovering radiusbinary linear codecharacter sums over finite fields

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Eigenvalues, eigenspaces and distances to subsets ⋮ On the covering radius of an unrestricted code as a function of the rate and dual distance

This page was built for publication: Upper bounds on the covering radius of a code with a given dual distance