New bounds for the minimum length of binary linear block codes

MaRDI QIDQ1310754zbMATH OpenFDO

Authors A. N. Ivanov, Stefan Dodunekov, Sylvia Encheva

Publication date 14 March 1994

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

\(n(9,d)\)binary linear codeGriesmer bound

Mathematics Subject Classification ID

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

Recommendations

• Some bounds for the minimum length of binary linear codes of dimension nine
• 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
• Bounds for binary codes of length less than 25
• Minimum possible block length of a linear binary code for some distances

Cited in

(14)

• Minimum block length of a linear q-ary code with specified dimension and code distance
• A new lower bound on the minimal length of a binary linear code
• The \([46, 9, 20]_2\) code is unique
• On the minimum length of some linear codes
• scientific article; zbMATH DE number 4074967 (Why is no real title available?)
• Bounds for binary codes of length less than 25
• The linear programming bound for binary linear codes
• scientific article; zbMATH DE number 702178 (Why is no real title available?)
• Some new results on the minimum length of binary linear codes of dimension nine
• Some bounds for the minimum length of binary linear codes of dimension nine
• Some new bounds for q-ary linear block codes
• Three best binary linear block codes of minimum distance fifteen
• Minimum possible block length of a linear binary code for some distances
• A new upper bound on nonbinary block codes

This page was built for publication: New bounds for the minimum length of binary linear block codes

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