Results 21 to 30 of about 38,534 (221)
Statistical Physics of Irregular Low-Density Parity-Check Codes [PDF]
, 1999 Low-density parity-check codes with irregular constructions have been recently shown to outperform the most advanced error-correcting codes to date. In this paper we apply methods of statistical physics to study the typical properties of simple irregular
Berrou G +27 more
core +3 more sources
Progressive Differences Convolutional Low-Density Parity-Check Codes [PDF]
, 2012 We present a new family of low-density parity-check (LDPC) convolutional codes that can be designed using ordered sets of progressive differences. We study their properties and define a subset of codes in this class that have some desirable features ...
Baldi, Marco +3 more
core +1 more source
Fifteen Years of Quantum LDPC Coding and Improved Decoding Strategies
IEEE Access, 2015 The near-capacity performance of classical low-density parity check (LDPC) codes and their efficient iterative decoding makes quantum LDPC (QLPDC) codes a promising candidate for quantum error correction.
Zunaira Babar +4 more
doaj +1 more source
Multilevel Structured Low-Density Parity-Check Codes [PDF]
2008 IEEE International Conference on Communications, 2008 Low-density parity-check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to store their code description, which can be represented either by the connections of the edges in their Tanner graph or by the non-zero entries in their parity-check matrix (PCM ...
Bonello, Nicholas +2 more
openaire +2 more sources
On the Stopping Distance of SA-LDPC Codes by Transversal Designs
IEEE Access, 2018 In this paper, we analyze the size of the smallest stopping set (called the stopping distance) for the parity-check matrix of a superposed array low-density parity-check (SA-LDPC) code for column weights 3 and 4 by using the transversal design (TD ...
Zahra Ferdosi +2 more
doaj +1 more source
Entropy, 2023 In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code ...
Yijie Lv +3 more
doaj +1 more source
Untainted Puncturing for Irregular Low-Density Parity-Check Codes [PDF]
, 2012 Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing.
Elkouss, David +2 more
core +6 more sources
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
IEEE Access, 2017 In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj +1 more source
Compact QC-LDPC Block and SC-LDPC Convolutional Codes for Low-Latency Communications
, 2018 Low decoding latency and complexity are two important requirements of channel codes used in many applications, like machine-to-machine communications. In this paper, we show how these requirements can be fulfilled by using some special quasi-cyclic low ...
Baldi, Marco +4 more
core +1 more source
Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth
, 2018 We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches.
Baldi, Marco +4 more
core +1 more source