On the covering radius of small codes

DOI10.1556/SSCMATH.40.2003.1-2.20MaRDI QIDQ4439500zbMATH OpenOpenAlexFDO

Authors Gerzson Kéri, Patric R. J. Östergård

Publication date 14 December 2003

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1556/sscmath.40.2003.1-2.20

zbMATH Keywords

covering codecovering radiusmixed codesurjective code

Mathematics Subject Classification ID

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

Recommendations

• Further results on the covering radius of small codes
• scientific article; zbMATH DE number 621972
• An updated table of binary/ternary mixed covering codes
• Some new lower bounds for binary and ternary covering codes
• Binary and ternary codes of covering radius one: some new lower bounds

Cited in

(12)

• Lower bounds on covering codes via partition matrices
• On lengthening of covering codes
• New upper bounds for binary covering codes
• Bounds for covering codes over large alphabets
• On small covering codes in arbitrary mixed hamming spaces
• scientific article; zbMATH DE number 621972 (Why is no real title available?)
• Disproof of a conjecture on the existence of balanced optimal covering codes
• An updated table of binary/ternary mixed covering codes
• On generalized surjective codes
• Covering and radius-covering arrays: constructions and classification
• Further results on the covering radius of small codes
• Bounds for short covering codes and reactive tabu search

This page was built for publication: On the covering radius of small codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4439500)