Non-linear cyclic codes that attain the Gilbert-Varshamov bound Academic Article uri icon


  • Abstract: We prove that there exist non-linear binary cyclic codes that attain the Gilbert- Varshamov bound. Subjects: Information Theory (cs. IT); Discrete Mathematics (cs. DM); Combinatorics (math. CO) Cite as: arXiv: 1701.01043 [cs. IT](or arXiv: 1701.01043 v1 [cs. IT] for this version) Submission history From: Michael Langberg [view email][v1] Wed, 4 Jan 2017 15: 11: 27 GMT (10kb)

publication date

  • January 1, 2017

published in