| 摘要 |
The process allows the construction of LDPC codes comprising N symbols, of which K are free, each code being defined by a check matrix A comprising M=N-K rows N columns and t nonzero symbols in each column. It consists: - in allocating the same number of nonzero symbols to all the rows of the check matrix A, - in taking as number of symbols t the smallest possible odd number, - in defining the columns in such a way that any two columns of the check matrix A have at most only one nonzero value, - and in defining the rows in such a way that two rows of the check matrix A have only one nonzero common value.
|
