Results 21 to 30 of about 48,269 (185)
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
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
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
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
Statistical Mechanics of Low-Density Parity Check Error-Correcting Codes over Galois Fields [PDF]
, 2000 A variation of low density parity check (LDPC) error correcting codes defined over Galois fields ($GF(q)$) is investigated using statistical physics.
Kabashima, Yoshiyuki +2 more
core +3 more sources
Entropy, 2016 Spatially coupled low-density parity-check (LDPC) codes have attracted considerable attention due to their promising performance. Recursive encoding of the codes with low delay and low complexity has been proposed in the literature but with constraints ...
Zhongwei Si, Sijie Wang, Junyang Ma
doaj +1 more source
Non Binary Low Density Parity Check Codes Decoding Over Galois Field [PDF]
, 2015 Conventional LDPC codes have a low decoding complexity but may have high encoding complexity. The encoding complexity is typically of the order O(n2)[5]. Also high storage space may be required to explicitly store the generator matrix. For long blocknbsp
Ahuja, Y. (Yogita), Bharti, R. (Ramesh)
core