Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications

DOI10.1023/A:1008397405457zbMath0955.94018OpenAlexW1524296568MaRDI QIDQ1591637

H. F. jun. Mattson, Heeralal Janwa

Publication date: 1 January 2001

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008397405457

zbMATH Keywords

covering radiusboundsGriesmer boundlinear codenormal codescoset leaderamalgamated direct sum

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (1)

Resolution of a conjecture on the covering radius of linear codes

This page was built for publication: Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications