| 摘要 |
<p>An information sequence having a code length of N (N=K+M), where K is information length and M is parity length, is encoded into a code sequence by using an LDPC code. The LDPC code is generated based on a matrix H, with M rows and N columns. The matrix H includes a check matrix H<Sub>2</Sub> and a check matrix H<Sub>1</Sub>. The check matrix H<Sub>2</Sub> has M rows and M columns, it is a cyclic permutation matrix, and an inverse matrix exists for the check matrix H<Sub>2</Sub>, and its column weight is 3. The check matrix H<Sub>1</Sub> has M rows and K columns.</p> |
