On lengthening of covering codes

DOI10.1016/0012-365X(92)90556-UzbMath0754.94015OpenAlexW2014447671MaRDI QIDQ1199613

Iiro S. Honkala

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90556-u

zbMATH Keywords

finite fieldslengthening of covering codesprime power alphabets

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (1)

A connection between sumsets and covering codes of a module

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds for football pool problems and mixed covering codes
• More coverings by rook domains
• Bounds for binary multiple covering codes
• On \((p,1)\)-subnormal \(q\)-ary covering codes
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Upper bounds for q-ary covering codes
• On the covering radius of codes
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• On the covering radius of small codes
• On the Addition of Residue Classes
• Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points
• The hardness of solving subset sum with preprocessing

This page was built for publication: On lengthening of covering codes