More on the Minimum Distance of Array LDPC Codes
Haiyang Liu, Shipei Yang, Gang Deng, Jie Chen · IEEE Communications Letters · 2014
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 m ≤ q. In this paper, an improved upper bound on the minimum distance of this class of codes is given.