码率上二元 Gilbert-Varshamov 界的渐近改进
信息论
2009-03-12 v2 math.IT
摘要
我们计算了通过贪心构造校验矩阵所获得的二元线性码的码参数。然后我们证明，这些码改进了关于码大小和码率的 Gilbert-Varshamov (GV) 界。该结果反驳了关于二元 GV 界渐近精确性的猜想。
引用
@article{arxiv.0903.0302,
title = {Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate},
author = {Dejan Spasov and Marjan Gusev},
journal= {arXiv preprint arXiv:0903.0302},
year = {2009}
}
备注
This submission has been withdrawn by author [arXiv admin]