Analytical lower bound on the lifting degree of multiple-edge QC-LDPC codes with girth 6

MR Sadeghi, F Amirzade - IEEE Communications Letters, 2018 - ieeexplore.ieee.org
Multiple-edge protographs have some advantages over single-edge protographs, such as
potentially having larger minimum Hamming distance. However, most of results in the …
被引用次数：23 相关文章

[引用][C] Near-Shannon-limit quasi-cyclic low-density parity-check codes

L Chen, J Xu, I Djurdjevic, S Lin - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
Near-Shannon-limit quasi-cyclic low-density parity-check codes Page 1 1038 IEEE
TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 7, JULY 2004 Near-Shannon-Limit …
被引用次数：289 相关文章 所有 5 个版本

Symmetrical constructions for regular girth-8 QC-LDPC codes

A Tasdighi, AH Banihashemi… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-
check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions …
被引用次数：68 相关文章
[PDF] psu.edu

Combinatorial constructions of low-density parity-check codes for iterative decoding

B Vasic, O Milenkovic - IEEE Transactions on information …, 2004 - ieeexplore.ieee.org
This paper introduces several new combinatorial constructions of low-density parity-check
(LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The …
被引用次数：357 相关文章 所有 10 个版本
[PDF] kenyon.edu

Design of capacity-approaching irregular low-density parity-check codes

TJ Richardson, MA Shokrollahi… - IEEE transactions on …, 2001 - ieeexplore.ieee.org
We design low-density parity-check (LDPC) codes that perform at rates extremely close to
the Shannon capacity. The codes are built from highly irregular bipartite graphs with …
被引用次数：4559 相关文章 所有 16 个版本