Binary codes with improved minimum weights (Corresp.)

DOI10.1109/TIT.1976.1055518MaRDI QIDQ4081123zbMATH OpenFDO

Authors William O. Alltop

Publication date 1976

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• An updated table of minimum-distance bounds for binary linear codes
• scientific article; zbMATH DE number 702178
• New binary codes
• New binary codes from a chain of cyclic codes
• scientific article; zbMATH DE number 1153457

Cited in

(9)

• New binary codes
• Minimum breakdown degradation in binary source encoding
• Binary linear codes with near-extremal maximum distance
• New binary codes from a chain of cyclic codes
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• An updated table of minimum-distance bounds for binary linear codes
• New binary codes from a generalization of Zinoviev's technique
• scientific article; zbMATH DE number 3878836 (Why is no real title available?)
• An improvement of the Griesmer bound for some small minimum distances

This page was built for publication: Binary codes with improved minimum weights (Corresp.)

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