The smallest length of eight-dimensional binary linear codes with prescribed minimum distance

DOI10.1109/18.850690MaRDI QIDQ4503617zbMATH OpenOpenAlexFDO

Authors David B. Jaffe, Veselin Vladislavov Vavrek, Iliya G. Bouyukliev

Publication date 7 September 2000

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

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

zbMATH Keywords

binary linear codesboundsminimum distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(5)

• On optimal linear codes over \(\mathbb F_5\)
• New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
• The \([46, 9, 20]_2\) code is unique
• On the binary projective codes with dimension 6
• PIR codes with short block length

This page was built for publication: The smallest length of eight-dimensional binary linear codes with prescribed minimum distance

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