2000 character limit reached
Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited (1401.2120v1)
Published 9 Jan 2014 in cs.IT and 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.