scientific article; zbMATH DE number 3251924
From MaRDI portal
Publication:5538637
zbMath0156.40701MaRDI QIDQ5538637
Publication date: 1963
Full work available at URL: http://www.rle.mit.edu/rgallager/documents/ldpc.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decoding algorithmLow-density parity-check (LDPC) codescomputer simulation of low-density decoding algorithmmulti-input channels
Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Decoding (94B35) Error probability in coding theory (94B70)
Related Items
SCALABLE AND EFFICIENT IMPLEMENTATIONS OF THE LDPC DECODER USING RECONFIGURABLE MODELS, Geometric Constructions of Gallager Codes, Belief propagation and loop series on planar graphs, A survey on fast correlation attacks, Loop series for discrete statistical models on graphs, The complexity of error-correcting codes, Linear-time list recovery of high-rate expander codes, Random matrices and codes for the erasure channel, Weight distribution moments of random linear/coset codes, Unnamed Item, Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds, Survey propagation: An algorithm for satisfiability, Performance bounds for QC-MDPC codes decoders, Unnamed Item, Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation, Unnamed Item, Design of experiments to detect nonnegligible variables in a linear model, Algebraic theory of block codes detecting independent errors, Coding of image feature descriptors for distributed rate-efficient visual correspondences, Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes, A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors, Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel, Nowhere to go but high: a perspective on high-dimensional expanders, An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems, Some combinatorial aspects of constructing bipartite-graph codes, Explicit constructions of graphs without short cycles and low density codes, Systematic design of single carrier overlap frequency domain equalization, Message-passing algorithms for inference and optimization, Error-correcting codes and cryptography, Properties of sparse random matrices over finite fields, On the Random Satisfiable Process, Reproducible families of codes and cryptographic applications, Vectorizing computations at decoding of nonbinary codes with small density of checks, Fast Correlation Attacks: Methods and Countermeasures, On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\), Symmetric LDPC codes and local testing, Unnamed Item, Rational maps and maximum likelihood decodings, Towards lower bounds on locally testable codes via density arguments, Generalized superposition modulation and iterative demodulation: a capacity investigation, Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth, Symmetric LDPC Codes and Local Testing, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition, LDPC based time-frequency double differential space-time coding for multi-antenna OFDM systems, A novel design methodology for high-performance programmable decoder cores for AA-LDPC codes, A coding scheme that increases the code rate, Unnamed Item, Photonic circuits for iterative decoding of a class of low-density parity-check codes, Gallager error-correcting codes for binary asymmetric channels, Fermions and loops on graphs: I. Loop calculus for determinants, LDPC codes constructed from cubic symmetric graphs, MB iterative decoding algorithm on systematic LDGM codes: performance evaluation, The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies, On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices, Unnamed Item, High-rate LDPC codes from partially balanced incomplete block designs
