首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于缩短RS码集合的低密度校验码的编码
引用本文:龚茂康,宋琦.基于缩短RS码集合的低密度校验码的编码[J].扬州大学学报(自然科学版),2005,8(1):43-45.
作者姓名:龚茂康  宋琦
作者单位:扬州大学,信息工程学院,江苏,扬州,225009
摘    要:提出了基于GF(q)上缩短RS码集合的低密度校验(lowerdensityparitycheck,LDPC)规则码生成方法.该方法能够从结构上避免校验矩阵中环4结构的出现,并且提出了码字矩阵、码字候选矩阵和码元候选矩阵的构造方法;给出了码字矩阵一些性质的构造性证明,这些性质对于消除环4结构至关重要.

关 键 词:RS码  低密度校验  编码  校验矩阵
文章编号:1007-824X(2005)01-0043-03

Encoding for regular LDPC codes based on the set of shortened RS codes
GONG Mao-kang,SONG Qi.Encoding for regular LDPC codes based on the set of shortened RS codes[J].Journal of Yangzhou University(Natural Science Edition),2005,8(1):43-45.
Authors:GONG Mao-kang  SONG Qi
Abstract: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.
Keywords:reed-solomon codes  LDPC codes  encoding  check-matrix
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号