Lower bounds for q-ary covering codes

DOI10.1109/18.54887zbMath0703.94014OpenAlexW2052433785MaRDI QIDQ3483225

Wende Chen, Iiro S. Honkala

Publication date: 1990

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

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

zbMATH Keywords

covering radiusminimal cardinalityq-ary codeCombinatorial lower bounds

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) 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)

Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ Binary codes with covering radius one: Some new lower bounds ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ Invariant sets under linear operator and covering codes over modules ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ A new lower bound for the football pool problem for 7 matches ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space ⋮ Bounds for covering codes over large alphabets

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