On the structure of linear codes with covering radius two and three

DOI10.1109/18.333857MaRDI QIDQ4324111zbMATH OpenOpenAlexFDO

Authors René Struik

Publication date 1 March 1995

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

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

zbMATH Keywords

binary block codescovering codescovering radiuslinear codeslower 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)

Recommendations

• New bounds for linear codes of covering radii 2 and 3
• Linear codes with covering radius R=2, 3 and codimension tR
• scientific article; zbMATH DE number 1188995
• Linear codes with covering radius 3
• Linear codes with covering radius 2 and other new covering codes
• Covering radii of ternary linear codes of small dimensions and codimensions
• The Generalized Covering Radii of Linear Codes
• New bounds for linear codes of covering radius 2
• Bounds on the covering radius of linear codes
• Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry

Cited in

(9)

• New quaternary linear codes with covering radius 2
• New bounds for linear codes of covering radius 2
• Critical problem for codes over finite chain rings
• Linear codes with covering radius 3
• New bounds for linear codes of covering radii 2 and 3
• On identifying codes that are robust against edge changes
• Codes for strong identification
• Linear inequalities for covering codes. II. Triple covering inequalities
• scientific article; zbMATH DE number 1505644 (Why is no real title available?)

This page was built for publication: On the structure of linear codes with covering radius two and three

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