Quasi-cyclic low-density parity-check codes from circulant permutation matrices
Quasi-cyclic low-density parity-check codes from circulant permutation matrices
复制标题
DOI：
10.1109/tit.2004.831841
复制
发表时间：
2004-08-01
影响因子：
2.5
通讯作者：
Fossorier, MPC
中科院分区：
文献类型：
--
作者：
Fossorier, MPC
在此对应关系中，研究了循环置换矩阵的低密度平价检查（LDPC）代码的构建。结果表明，此类代码不能具有大于12大于12的坦纳图表示，并且相对温和且充分的条件使代码的围绕6、8、10或12得出。这些结果表明，具有此围绕围绕值的LDPC代码家族相对容易获得，因此，应考虑其他参数，例如最小距离或冗余校验和的数量。为此，提出了所研究的代码达到其最大可能的最小锤距的必要条件。
In this correspondence, the construction of low-density parity-check (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively mild necessary and sufficient condition for the code to have a girth of 6, 8, 10, or 12 is derived. These results suggest that families of LDPC codes with such girth values are relatively easy to obtain and, consequently, additional parameters such as the minimum distance or the number of redundant check sums should be considered. To this end, a necessary condition for the codes investigated to reach their maximum possible minimum Hamming distance is proposed.