A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

We propose a new ensemble of binary low-density parity-check codes with paritycheck matrices based on repetition codes and permutation matrices. The proposed class of codes is a subensemble of quasi-cyclic codes. For the constructed ensemble, we obtain minimum distance estimates. We present simulation results for the proposed code constructions under the (Sum-Product) iterative decoding algorithm for transmission over an additive white Gaussian noise channel using binary phase-shift keying.

作者简介

F. Ivanov

Kharkevich Institute for Information Transmission Problems

编辑信件的主要联系方式.
Email: fii@iitp.ru
俄罗斯联邦, Moscow

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2017