Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
arXiv:1401.2120
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.
arXiv comment4 pages, 1 figure, submitted to IEEE ISIT 2014