Non-linear Cyclic Codes that Attain the Gilbert-Varshamov Bound

2017/01/04 by Haviv, Ishay, Langberg, Michael, Schwartz, Moshe +1 · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1701.01043

Abstract

We prove that there exist non-linear binary cyclic codes that attain the Gilbert-Varshamov bound.

Cited by

• Abelian multi-cycle codes for single-shot error correction

Related

• Proof of tightness of Varshamov - Gilbert bound for binary codes
• Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes
• Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate
• Asymptotic Gilbert-Varshamov bound on Frequency Hopping Sequences
• Ds-bounds for cyclic codes: new bounds for abelian codes