Upper bounds for q-ary covering codes

DOI10.1109/18.79926zbMath0731.94015OpenAlexW2988531221MaRDI QIDQ3358650

Patric R. J. Östergård

Publication date: 1991

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

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

zbMATH Keywords

covering radiusnormal codesq-ary covering codes

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 (9)

New upper bounds for the football pool problem for 11 and 12 matches ⋮ Further results on the covering radius of small codes ⋮ New upper bounds for binary covering codes ⋮ Invariant sets under linear operator and covering codes over modules ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ On lengthening of covering codes ⋮ Bounds for short covering codes and reactive tabu search ⋮ Bounds for binary multiple covering codes ⋮ On the normality of multiple covering codes

This page was built for publication: Upper bounds for q-ary covering codes