Some bounds for the minimum length of binary linear codes of dimension nine

DOI10.1109/18.841184MaRDI QIDQ4503570zbMATH OpenOpenAlexFDO

Authors Sugi Guritman, 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://semanticscholar.org/paper/ff6e4ecfc9971eae5256563f25f7d856de80e411

zbMATH Keywords

minimum-length boundsoptimal binary linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• New bounds for the minimum length of binary linear block codes
• Some new results on the minimum length of binary linear codes of dimension nine
• A new lower bound on the minimal length of a binary linear code
• New optimal binary linear codes of dimensions 9 and 10
• New bounds on binary linear codes of dimension eight (Corresp.)

Cited in

(8)

• New bounds for the minimum length of binary linear block codes
• A new lower bound on the minimal length of a binary linear code
• The \([46, 9, 20]_2\) code is unique
• Some new results on the minimum length of binary linear codes of dimension nine
• On the size of optimal binary codes of length 9 and covering radius 1
• On the minimum length of linear codes over the field of 9 elements
• Ternary dual codes of the planes of order nine
• The degree of functions and weights in linear codes.

This page was built for publication: Some bounds for the minimum length of binary linear codes of dimension nine

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