Proof of tightness of Varshamov - Gilbert bound for binary codes
Information Theory
2017-06-13 v5 math.IT
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
Cite
@article{arxiv.1606.01592,
title = {Proof of tightness of Varshamov - Gilbert bound for binary codes},
author = {Vladimir Blinovsky},
journal= {arXiv preprint arXiv:1606.01592},
year = {2017}
}
Comments
small corrections add q-art case