Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes

DOI10.1109/TIT.2008.928288zbMath1318.94120arXiv0708.4164OpenAlexW3099207695MaRDI QIDQ3604811

Gilles Zémor, Philippe Gaborit

Publication date: 24 February 2009

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

Full work available at URL: https://arxiv.org/abs/0708.4164

Mathematics Subject Classification ID

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

Related Items (5)

A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Speeding-up verification of digital signatures ⋮ On circulant self-dual codes over small fields

This page was built for publication: Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes