| 单秀玲,李铁楠.低密度奇偶校验码的构造[J].数学研究及应用,2013,33(3):330~336 |
| 低密度奇偶校验码的构造 |
| A Construction of Low-Density Parity-Check Codes |
| 投稿时间：2011-11-06 修订日期：2012-05-22 |
| DOI：10.3770/j.issn:2095-2651.2013.03.007 |
| 中文关键词: 低密度奇偶校验码，迭代译码，可分组设计。 |
| 英文关键词:low-density parity-check code iterative decoding group divisible design. |
| 基金项目:国家自然科学基金 (Grant Nos.11071056; 11201114). |
|
| 摘要点击次数: 3778 |
| 全文下载次数: 3964 |
| 中文摘要: |
| 低密度奇偶校验码(LDPC)最早是由Gallager于1962年提出.它们是线性分组码,其比特错误率极大地接近香农界.1995年Mackay和Neal发掘了LDPC码的新应用后,LDPC码引起了人们的广泛关注.本文利用组合结构给出一些新的LDPC码:利用可分组设计构造一类Tanner图中不含四长圈的正则LDPC码. |
| 英文摘要: |
| Low-density parity-check ($LDPC$) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The $LDPC$ codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular $LDPC$ codes based on group divisible designs which have Tanner graphs free of four-cycles. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
