Lower bounds for \(q\)-ary codes of covering radius one

DOI10.1016/S0012-365X(99)00338-6zbMath0947.94031OpenAlexW1969442043MaRDI QIDQ1567663

Wolfgang Haas

Publication date: 3 August 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00338-6

zbMATH Keywords

lower bounds\(q\)-ary codeminimal cardinalitycovering radius onesphere covering bound

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

An updated table of binary/ternary mixed covering codes ⋮ Bounds for covering codes over large alphabets

This page was built for publication: Lower bounds for \(q\)-ary codes of covering radius one