Three best binary linear block codes of minimum distance fifteen

DOI10.1109/18.335909MaRDI QIDQ4838653zbMATH OpenOpenAlexFDO

Authors

Publication date 12 July 1995

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

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

zbMATH Keywords

binary linear codessearch algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• Minimum possible block length of a linear binary code for some distances
• scientific article; zbMATH DE number 702178
• scientific article; zbMATH DE number 1189040
• Construction of some binary linear codes of minimum distance five
• New bounds for the minimum length of binary linear block codes
• Minimum block length of a linear q-ary code with specified dimension and code distance
• Optimal binary linear codes of length \(\leq 30\)
• Two new bounds on the size of binary codes with a minimum distance of three
• Binary linear codes with near-extremal maximum distance
• Five new optimal ternary linear codes

This page was built for publication: Three best binary linear block codes of minimum distance fifteen

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