A note on bounds for q-ary covering codes

DOI10.1109/18.532916zbMath0857.94024OpenAlexW1974563962MaRDI QIDQ4896858

No author found.

Publication date: 12 March 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.532916

zbMATH Keywords

covering radiuscovering codes\(q\)-ary code

Mathematics Subject Classification ID

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

Related Items (8)

Further results on the covering radius of small codes ⋮ Invariant sets under linear operator and covering codes over modules ⋮ On the covering radius of some modular codes ⋮ Bounds for short covering codes and reactive tabu search ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Lower bounds on covering codes via partition matrices ⋮ Construction of new codes and its related parameters ⋮ Bounds for covering codes over large alphabets

This page was built for publication: A note on bounds for q-ary covering codes