A new lower bound on the minimal length of a binary linear code

DOI10.1006/EUJC.1996.0028MaRDI QIDQ1916055zbMATH OpenOpenAlexFDO

Authors M. C. Bhandari, M. S. Garg

Publication date 4 December 1996

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1996.0028

zbMATH Keywords

lower boundsminimal lengthbinary linear code

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 bounds for the minimum length of binary linear codes of dimension nine
• New bounds on binary linear codes of dimension eight (Corresp.)
• Some new results on the minimum length of binary linear codes of dimension nine
• Bounds for binary codes of length less than 25

Cited in

(12)

• Bounds for binary codes of length less than 25
• One more proof of the first linear programming bound for binary codes and two conjectures
• scientific article; zbMATH DE number 702178 (Why is no real title available?)
• Some results on the existence of binary linear codes (Corresp.)
• New lower bounds on aperiodic crosscorrelation of binary codes
• Optimal binary linear codes of length \(\leq 30\)
• Minimum possible block length of a linear binary code for some distances
• 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
• scientific article; zbMATH DE number 5524392 (Why is no real title available?)
• Minimum block length of a linear q-ary code with specified dimension and code distance
• New bounds for the minimum length of binary linear block codes

This page was built for publication: A new lower bound on the minimal length of a binary linear code

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