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

DOI10.1109/TIT.2002.808099zbMath1063.94126OpenAlexW2132819612MaRDI QIDQ4679953

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)

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