More on the Minimum Distance of Array LDPC Codes

摘要

Array low-density parity-check (LDPC) codes are a special class of quasi-cyclic LDPC codes constructed from a pair of integers $(m, q)$, where $q$ is an odd prime, and $mleq q$. In this paper, an improved upper bound on the minimum distance of this class of codes is given.