摘要
当前LDPC码的构造方法都是偏重于提高码的性能、降低编码复杂度2个方面,没有考虑码组之间的汉明距离和汉明距离分布,从而漏检部分突发错误。给出了一种次优的考虑码组汉明距离分布的构造方法,和已有的方法相比,这种方法构造的LDPC码不仅可以检突发长度小于校验矩阵秩的突发错误,并且保持纠随机错误性能不变。
The coding of LDPC codes is focused on several aspects： high error-correction, low coding complexity and so on. All the construction methods do not give much consideration on hamming-distance and its distribution because of computation complexity. A suboptimal scheme which is with emphasis on hamming-distance and its distribution was presented. The codes introduced frown this scheme can detect all burst-errors within the length of check matrix＇s rank and has no loss in performance of random-error-correction.
出处
《通信学报》
EI
CSCD
北大核心
2007年第11期111-115,共5页
Journal on Communications
