Sharpening the Gilbert-Varshamov bound in the finite case

DOI10.1080/09720529.2001.10697920zbMath0991.94062OpenAlexW2332598108MaRDI QIDQ2766135

Francesco Fabris

Publication date: 27 January 2002

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2001.10697920

zbMATH Keywords

Gilbert-Varshamov bound

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (2)

The clique distribution in powers of hypercubes ⋮ Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on the existence of binary linear codes (Corresp.)
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Some results on the weight distribution of linear codes

This page was built for publication: Sharpening the Gilbert-Varshamov bound in the finite case