On the number of minimum stopping sets and minimum codewords of array LDPC codes

Authors:
Haiyang Liu;Lianrong Ma;Jie Chen
Affiliations:
Institute of Microelectronics, Chinese Academy of Sciences, Beijing, China;Department of Mathematical Sciences, Tsinghua University, Beijing, China;Institute of Microelectronics, Chinese Academy of Sciences, Beijing, China
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 0

On the stopping distance of array code parity-check matrices

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
On the minimum distance of array codes as LDPC codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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).