基于缩短RS码集合的低密度校验码的编码  

Encoding for regular LDPC codes based on the set of shortened RS codes

作　　者：龚茂康[1] 宋琦[1] 

机构地区：[1]扬州大学信息工程学院,江苏扬州225009

出　　处：《扬州大学学报（自然科学版）》2005年第1期43-45,共3页Journal of Yangzhou University：Natural Science Edition

摘　　要：提出了基于GF(q)上缩短RS码集合的低密度校验(lowerdensityparitycheck,LDPC)规则码生成方法.该方法能够从结构上避免校验矩阵中环4结构的出现,并且提出了码字矩阵、码字候选矩阵和码元候选矩阵的构造方法;给出了码字矩阵一些性质的构造性证明,这些性质对于消除环4结构至关重要.Based on the set of shortened RS code in GF(q), a generating method for the regular (LDPC) code is proposed, which is free of cycles of length 4 in the check-matrix. The structural methods for code matrix and candidate-symbol-matrix are presented in this paper and the constructive proof for some properties of code matrix are also given. These properties are of important to be free of cycles of length 4.

关 键 词：RS码 低密度校验 编码 校验矩阵 

分 类 号：TN911.22[电子电信—通信与信息系统]