scientific article; zbMATH DE number 729918

MaRDI QIDQ4325147zbMATH OpenFDO

Authors Stefan Dodunekov, Nikolai L. Manev

Publication date 30 March 1995

zbMATH Keywords

BCH codebinary linear codescovering radiuslower boundminimal distance

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

• On the least covering radius of binary linear codes with small lengths
• Linear codes with covering radius 3
• Short codes with a given covering radius
• The length of primitive BCH codes with minimal covering radius
• Linear codes with covering radius 2 and other new covering codes

Cited in

(7)

• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• New results on codes with covering radius 1 and minimum distance 2
• On codes with covering radius 1 and minimum distance 2
• scientific article; zbMATH DE number 702178 (Why is no real title available?)
• On the least covering radius of binary linear codes with small lengths
• On the least covering radius of binary linear codes of dimension 6
• Minimum possible block length of a linear binary code for some distances

This page was built for publication:

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