Proof of tightness of Varshamov - Gilbert bound for binary codes
Abstract
We prove tightness of right logarithmic asymptotic of Varshamov- Gilbert bound for linear binary codes We find general asymptotic coding bound for linear codes
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.