On \((p,1)\)-subnormal \(q\)-ary covering codes

DOI10.1016/0166-218X(94)90141-4zbMath0799.94013MaRDI QIDQ1331896

Iiro S. Honkala

Publication date: 22 November 1994

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

zbMATH Keywords

covering radiuscovering codessubnormalitylinear \(q\)-ary codes

Mathematics Subject Classification ID

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

Related Items (4)

Long binary narrow-sense BCH codes are normal ⋮ On lengthening of covering codes ⋮ Bounds for binary multiple covering codes ⋮ On the normality of multiple covering codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More coverings by rook domains
• Some lower bounds for constant weight codes
• On (k, t)-subnormal covering codes
• On normal and subnormal q-ary codes
• On the covering radius of codes
• Lexicographic codes: Error-correcting codes from game theory
• Further results on the covering radius of codes
• Lower bounds for binary covering codes
• A new construction for covering codes
• Further results on (k, t)-subnormal covering codes
• A Combinatorial Problem in Matching
• Modified bounds for covering codes

This page was built for publication: On \((p,1)\)-subnormal \(q\)-ary covering codes