[PDF][PDF] Introducing low-density parity-check codes
SJ Johnson - University of Newcastle, Australia, 2006 - researchgate.net
Low-density parity-check (LDPC) codes are forward error-correction codes, first proposed in
the 1962 PhD thesis of Gallager at MIT. At the time, their incredible potential remained …
the 1962 PhD thesis of Gallager at MIT. At the time, their incredible potential remained …
Set of irregular LDPC codes with random structure and low encoding complexity
Q Spencer - US Patent 7,523,375, 2009 - Google Patents
(57) ABSTRACT A set of irregular LDPC (Low Density Parity Check) codes having a pseudo-
random structure and low encoding com plexity. A block-cyclic LDPC code has an irregular …
random structure and low encoding com plexity. A block-cyclic LDPC code has an irregular …
Codes for iterative decoding from partial geometries
SJ Johnson, SR Weller - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
This paper develops codes suitable for iterative decoding using the sum-product algorithm.
By considering a large class of combinatorial structures, known as partial geometries, we …
By considering a large class of combinatorial structures, known as partial geometries, we …
Entanglement-assisted quantum low-density parity-check codes
This article develops a general method for constructing entanglement-assisted quantum low-
density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit …
density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit …
Jointly designed quasi-cyclic LDPC-coded cooperation with diversity combining at receiver
This correspondence proposes a jointly-designed quasi-cyclic (QC) low-density parity-check
(LDPC)-coded multi-relay cooperation with a destination node realized by multiple receive …
(LDPC)-coded multi-relay cooperation with a destination node realized by multiple receive …
Construction of high-rate regular quasi-cyclic LDPC codes based on cyclic difference families
For a high-rate case, it is difficult to randomly construct good low-density parity-check
(LDPC) codes of short and moderate lengths because their Tanner graphs are prone to …
(LDPC) codes of short and moderate lengths because their Tanner graphs are prone to …
[图书][B] Algebraic and stochastic coding theory
DK Kythe, PK Kythe - 2012 - api.taylorfrancis.com
The purpose of writing this book is primarily to make the subject of coding theory easy for the
senior or graduate students who possess a thorough understanding of digital arithmetic …
senior or graduate students who possess a thorough understanding of digital arithmetic …
LDPC codes from generalized polygons
Z Liu, DA Pados - IEEE transactions on information theory, 2005 - ieeexplore.ieee.org
We use the theory of finite classical generalized polygons to derive and study low-density
parity-check (LDPC) codes. The Tanner graph of a generalized polygon LDPC code is …
parity-check (LDPC) codes. The Tanner graph of a generalized polygon LDPC code is …
A construction of high performance quasicyclic LDPC codes: a combinatoric design approach
This correspondence presents a construction of quasicyclic (QC) low‐density parity‐check
(LDPC) codes based on a special type of combinatorial designs known as block disjoint …
(LDPC) codes based on a special type of combinatorial designs known as block disjoint …