On the least covering radius of binary linear codes with small lengths

DOI10.1109/TIT.2002.808099MaRDI QIDQ4679953zbMATH OpenOpenAlexFDO

Authors Veselin Vladislavov Vavrek, Tsonka Stefanova Baicheva

Publication date 31 May 2005

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) 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 of dimension 6
• Linear codes with covering radius 3
• scientific article; zbMATH DE number 729918
• Short codes with a given covering radius
• scientific article; zbMATH DE number 1188977

Cited in

(10)

• On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)
• The smallest covering code of length 8 and radius 2 has 12 words
• On small covering codes in arbitrary mixed hamming spaces
• scientific article; zbMATH DE number 1188977 (Why is no real title available?)
• scientific article; zbMATH DE number 1189030 (Why is no real title available?)
• scientific article; zbMATH DE number 729918 (Why is no real title available?)
• Codes over GF(3) of length 5, 27 codewords, and covering radius 1
• On the size of optimal binary codes of length 9 and covering radius 1
• On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
• On the least covering radius of binary linear codes of dimension 6

This page was built for publication: On the least covering radius of binary linear codes with small lengths

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