Title :
On the Number of Minimum Stopping Sets and Minimum Codewords of Array LDPC Codes
Author :
Liu, Haiyang ; Ma, Lianrong ; Chen, Jie
Author_Institution :
Inst. of Microelectron., Chinese Acad. of Sci., Beijing, China
fDate :
7/1/2010 12:00:00 AM
Abstract :
For an odd prime q and an integer m ≤ q, a binary mq × q2 quasi-cyclic parity-check matrix H(m,q) can be constructed for a class of array LDPC code C(m,q). In this letter, the closed-form formula for the numbers of minimum stopping sets of H(m,q) and minimum codewords of C(m,q) are given for 2 ≤ m ≤ 3 and for (m,q)=(4,5) and (4,7).
Keywords :
cyclic codes; matrix algebra; parity check codes; LDPC code array minimum codewords; closed-form formula; low-density parity-check code; minimum stopping sets; quasi-cyclic parity-check matrix code; Arrays; Equations; Hamming distance; Iterative decoding; Linear code; Linear matrix inequalities; Matrix decomposition; Microelectronics; Parity check codes; Vectors; Minimum stopping set; array code; low-density parity-check (LDPC) code; minimum codeword;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2010.07.100427
