New covering codes from an ADS-like construction

DOI10.1109/TIT.2003.813508MaRDI QIDQ3547101zbMATH OpenFDO

Authors Petri Rosendahl, Markku K. Kaikkonen

Publication date 21 December 2008

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

Mathematics Subject Classification ID

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

Recommendations

• New constructions of covering codes
• New quaternary linear codes with covering radius 2
• Construction of linear covering codes
• New constructions for \(q\)-ary covering codes
• Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications

Cited in

(8)

• Some upper bounds on the covering radii of linear codes over \({\mathbb{F}}_q\) and their applications
• New constructions of covering codes
• New quaternary linear codes with covering radius 2
• Recipes for adjoint code construction
• scientific article; zbMATH DE number 5121566 (Why is no real title available?)
• Minimal 1-saturating sets and complete caps in binary projective spaces.
• Covering machines
• On lengthening of covering codes

This page was built for publication: New covering codes from an ADS-like construction

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