Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
Information Theory
2014-01-10 v1 math.IT
Abstract
Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.
Cite
@article{arxiv.1401.2120,
title = {Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited},
author = {Alexey Frolov and Pavel Rybin},
journal= {arXiv preprint arXiv:1401.2120},
year = {2014}
}
Comments
4 pages, 1 figure, submitted to IEEE ISIT 2014