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

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…