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
Message passing algorithms for non-linear nodes and data compression [PDF]
, 2005 The use of parity-check gates in information theory has proved to be very efficient. In particular, error correcting codes based on parity checks over low-density graphs show excellent performances.
Ciliberti, S., Mezard, M., Zecchina, R.
core +2 more sources
Genetic Optimization of LDPC Codes to Improve the Correction of Burst Errors [PDF]
EPJ Web of Conferences, 2020 Error correction plays a crucial role when transmitting data from the source to the destination through a noisy channel. It has found many applications in television broadcasting services, data transmission in radiation harsh environment (e. g.
Broulím Jan +2 more
doaj +1 more source
Subsystem Codes with High Thresholds by Gauge Fixing and Reduced Qubit Overhead
Physical Review X, 2021 We introduce a technique that uses gauge fixing to significantly improve the quantum-error-correcting performance of subsystem codes. By changing the order in which check operators are measured, valuable additional information can be gained, and we ...
Oscar Higgott, Nikolas P. Breuckmann
doaj +1 more source
Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes
, 2019 In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes.
A Becker +16 more
core +1 more source
New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
IEEE Access, 2020 Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value.
Xuemei Liu, Lihua Jia
doaj +1 more source
Array Convolutional Low-Density Parity-Check Codes
, 2013 This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC)
Baldi, Marco +2 more
core +1 more source
Weight Distributions of Regular Low-Density Parity-Check Codes over Finite Fields [PDF]
, 2011 The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight ...
Chen, Yan +4 more
core +1 more source
A Fast Convergence Density Evolution Algorithm for Optimal Rate LDPC Codes in BEC
, 2014 We derive a new fast convergent Density Evolution algorithm for finding optimal rate Low-Density Parity-Check (LDPC) codes used over the binary erasure channel (BEC).
Tavakoli, Hassan
core +1 more source
The Effect of Saturation on Belief Propagation Decoding of LDPC Codes
, 2014 We consider the effect of LLR saturation on belief propagation decoding of low-density parity-check codes. Saturation occurs universally in practice and is known to have a significant effect on error floor performance.
Iyengar, Aravind +2 more
core +1 more source