Some results on the existence of binary linear codes (Corresp.)

DOI10.1109/TIT.1983.1056743MaRDI QIDQ3315431zbMATH OpenFDO

Authors Michele Elia

Publication date 1983

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

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

zbMATH Keywords

Varshamov bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• A new lower bound on the minimal length of a binary linear code
• Numerical results on the asymptotic rate of binary codes
• scientific article; zbMATH DE number 702178
• scientific article; zbMATH DE number 774615
• Bounds for binary codes of length less than 25

Cited in

(14)

• Every binary code can be realized by convex sets
• Strengthening the Gilbert-Varshamov bound
• The clique distribution in powers of hypercubes
• Note on the size of binary Armstrong codes
• Sharpening the Gilbert-Varshamov bound in the finite case
• On the intersection of binary linear codes
• The nonexistence of certain binary linear codes
• Configuration in binary linear codes
• scientific article; zbMATH DE number 4077121 (Why is no real title available?)
• scientific article; zbMATH DE number 6807172 (Why is no real title available?)
• All Binary Linear Codes That Are Invariant Under <inline-formula> <tex-math notation="LaTeX">${\mathrm{PSL}}_2(n)$ </tex-math> </inline-formula>
• One more proof of the first linear programming bound for binary codes and two conjectures
• Improving the Gilbert-Varshamov bound by graph spectral method
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: Some results on the existence of binary linear codes (Corresp.)

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