The capacity of low-density parity-check codes under message-passing decoding
From MaRDI portal
Recommendations
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
- scientific article; zbMATH DE number 3511980
- On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
- Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
- scientific article; zbMATH DE number 4216926
- Low-density parity-check codes over gaussian channels with erasures
- The Stability of Low-Density Parity-Check Codes and Some of its Consequences
- Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
- Low-density parity-check codes and the related performance analysis methods
Cited in
(80)- Graph-based channel detection for multitrack recording channels
- Channel decomposition for multilevel codes over multilevel and partial erasure channels
- Convergence and correctness of belief propagation for the Chinese postman problem
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
- A library for formalization of linear error-correcting codes
- Construction of LDPC convolutional codes via difference triangle sets
- Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
- On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
- Analysis of the dynamics of iterative interference cancellation in iterative decoding
- Performance limits of compound codes with symbol-based iterative decoding
- scientific article; zbMATH DE number 1714656 (Why is no real title available?)
- Weighted enumeration of spanning subgraphs in locally tree-like graphs
- An accurate density evolution analysis for a finite-state Markov channel
- Parallel finite element technique using Gaussian belief propagation
- Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
- Photonic circuits for iterative decoding of a class of low-density parity-check codes
- Random instances of problems in NP -- algorithms and statistical physics
- Expander graphs and their applications
- A class of quantum low-density parity check codes by combining seed graphs
- A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
- Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
- Properties of Optimum Binary Message-Passing Decoders
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel
- Product Accumulate Codes: A Class of Codes With Near-Capacity Performance and Low Decoding Complexity
- Performance of low-density parity-check codes with linear minimum distance
- Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
- Complexity Versus Performance of Capacity-Achieving Irregular Repeat–Accumulate Codes on the Binary Erasure Channel
- Density Evolution for Asymmetric Memoryless Channels
- Mean field and mixed mean field iterative decoding of low-density parity-check codes
- Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q
- Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
- On Designing Good LDPC Codes for Markov Channels
- Capacity Achieving LDPC Codes Through Puncturing
- The density evolution for layered decoding algorithms of low-density parity-check codes
- Coding of image feature descriptors for distributed rate-efficient visual correspondences
- The capacity and coding gain of certain checkerboard codes
- Renormalization group approach to error-correcting codes
- scientific article; zbMATH DE number 1504647 (Why is no real title available?)
- scientific article; zbMATH DE number 1775410 (Why is no real title available?)
- Improved low-density parity-check codes using irregular graphs
- Design of capacity-approaching irregular low-density parity-check codes
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
- Signal-space characterization of iterative decoding
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
- Bounds on the performance of belief propagation decoding
- A new approach to Laplacian solvers and flow problems
- Fast fitness improvements in estimation of distribution algorithms using belief propagation
- Joint message-passing decoding of LDPC codes and partial-response channels
- Existence and uniqueness of the solution for turbo decoding of parallel concatenated single parity check codes
- scientific article; zbMATH DE number 2086429 (Why is no real title available?)
- Symmetric LDPC codes and local testing
- The theoretical capacity of the parity source coder
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- Low-density parity-check codes achieve list-decoding capacity
- Message passing algorithms and improved LP decoding
- Code optimization, frozen glassy phase and improved decoding algorithms for low-density parity-check codes
- Symmetric LDPC codes and local testing
- Gallager error-correcting codes for binary asymmetric channels
- SCALABLE AND EFFICIENT IMPLEMENTATIONS OF THE LDPC DECODER USING RECONFIGURABLE MODELS
- STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- Estimation and Marginalization Using the Kikuchi Approximation Methods
- scientific article; zbMATH DE number 2226643 (Why is no real title available?)
- Prediction errors for penalized regressions based on generalized approximate message passing
- Codes on graphs: Recent progress
- Statistical mechanics and capacity-approaching error-correcting codes
- Iterative decoding of LDPC codes: some bounds and properties
- Decoding turbo-like codes via linear programming
- Efficient information reconciliation for high-dimensional quantum key distribution
- Convergence and correctness of belief propagation for weighted min-max flow
- Phase transitions of structured codes of graphs
- When can an expander code correct (n) errors in O(n) time?
- An efficient algorithm for counting cycles in QC and APM LDPC codes
- Fixed points and stability of density evolution
- LDPC code design for nonuniform power-line channels
- EXIT analysis of M-algorithm based MIMO detectors and LDPC code design optimization
- Constructions of QC LDPC codes based on integer sequences
- Group testing with random pools: Phase transitions and optimal strategy
This page was built for publication: The capacity of low-density parity-check codes under message-passing decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544509)
