Bounds on the covering radius of linear codes
From MaRDI portal
Publication:1866019
DOI10.1023/A:1019995105405zbMath1020.94033MaRDI QIDQ1866019
Alexander Barg, Alexei Ashikhmin
Publication date: 3 April 2003
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
linear codesChristoffel-Darboux kerneldual distancedistance distributionasymptotics of Krawtchouk polynomials
Linear codes (general theory) (94B05) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
This page was built for publication: Bounds on the covering radius of linear codes