A lower hound on binary codes with covering radius one

DOI10.1007/3-540-57843-9_5MaRDI QIDQ4954408zbMATH OpenFDO

Authors Iiro Honkala

Publication date 7 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57843-9_5

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial lower bounds on binary codes with covering radius one
• Binary codes with covering radius one: Some new lower bounds
• Several new lower bounds on the size of codes with covering radius one
• Some new lower bounds for binary and ternary covering codes

Cited in

(6)

• Binary codes with covering radius one: Some new lower bounds
• Combinatorial lower bounds on binary codes with covering radius one
• A new binary code of length 10 and covering radius 1
• Several new lower bounds on the size of codes with covering radius one
• Bounds for abnormal binary codes with covering radius one
• On the general excess bound for binary codes with covering radius one

This page was built for publication: A lower hound on binary codes with covering radius one

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