On the least covering radius of binary linear codes of dimension 6

DOI10.3934/AMC.2010.4.399zbMATH Open1213.94167OpenAlexW2051305428MaRDI QIDQ540386FDOQ540386

Authors: Tsonka Stefanova Baicheva, Iliya G. Bouyukliev 

Publication date: 3 June 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2010.4.399

Recommendations

• ON THE MINIMUM LENGTH OF SOME LINEAR CODES OF DIMENSION 6
• On the least covering radius of binary linear codes with small lengths
• On optimal ternary linear codes of dimension 6
• scientific article; zbMATH DE number 729918
• On the covering radius of binary (14, 6) codes containing the all-one vector
• Bounds on the covering radius of linear codes
• scientific article; zbMATH DE number 1188977
• On the covering radius of binary codes (Corresp.)
• On the binary projective codes with dimension 6
• On the Covering Dimension of a Linear Code

zbMATH Keywords

covering radiusbinary linear codesclassification of codesleast covering radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (3)

• Title not available (Why is that?)
• Hexagonal metric for linear codes over a finite field
• On the least covering radius of binary linear codes with small lengths

This page was built for publication: On the least covering radius of binary linear codes of dimension 6

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