Strengthening the Gilbert-Varshamov bound

DOI10.1016/S0024-3795(99)00271-2zbMath0996.94040OpenAlexW2087737172MaRDI QIDQ1973922

Sugi Guritman, Alexander Barg, Simonis, Juriaan

Publication date: 4 November 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(99)00271-2

zbMATH Keywords

linear codesweight distributionlower boundsGilbert-Varshamov boundminimum distance of linear codesnon-asymptotic improvements

Mathematics Subject Classification ID

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

Related Items (2)

The clique distribution in powers of hypercubes ⋮ Bounds on codes derived by counting components in Varshamov graphs

Uses Software

• Code Tables

Cites Work

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

This page was built for publication: Strengthening the Gilbert-Varshamov bound