Proof of tightness of Varshamov - Gilbert bound for binary codes
Vladimir Blinovsky
TL;DR
This paper proves the tightness of the asymptotic form of the Varshamov-Gilbert bound for linear binary codes, establishing its accuracy in the right logarithmic scale.
Contribution
It demonstrates the tightness of the asymptotic Varshamov-Gilbert bound for linear binary codes and derives a general asymptotic coding bound.
Findings
Confirmed the tightness of the Varshamov-Gilbert bound asymptotically
Derived a general asymptotic coding bound for linear codes
Enhanced understanding of bounds for binary code performance
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Mathematical Approximation and Integration