The capacity of low-density parity-check codes under message-passing decoding
From MaRDI portal
Publication:4544509
DOI10.1109/18.910577zbMath1019.94033OpenAlexW2169732368MaRDI QIDQ4544509
Thomas J. Richardson, Ruediger Urbanke
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.910577
capacitylow-density parity-check codesprobability of errormemoryless channelturbo decodingturbo-codesbelief-propagation decodersmessage-passing decoding
Other types of codes (94B60) Decoding (94B35) Error probability in coding theory (94B70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items
On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes, LDPC code design for nonuniform power-line channels, SCALABLE AND EFFICIENT IMPLEMENTATIONS OF THE LDPC DECODER USING RECONFIGURABLE MODELS, STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS, Parallel finite element technique using Gaussian belief propagation, EXIT analysis of M-algorithm based MIMO detectors and LDPC code design optimization, Random Instances of Problems in NP – Algorithms and Statistical Physics, A class of quantum low-density parity check codes by combining seed graphs, Unnamed Item, Decoding turbo-like codes via linear programming, Constructions of QC LDPC codes based on integer sequences, Coding of image feature descriptors for distributed rate-efficient visual correspondences, Expander graphs and their applications, A library for formalization of linear error-correcting codes, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation, Estimation and Marginalization Using the Kikuchi Approximation Methods, Group testing with random pools: Phase transitions and optimal strategy, Construction of LDPC convolutional codes via difference triangle sets, Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation, Symmetric LDPC codes and local testing, Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth, Convergence and correctness of belief propagation for the Chinese postman problem, Symmetric LDPC Codes and Local Testing, Codes on graphs: Recent progress, Iterative decoding of LDPC codes: some bounds and properties, Channel decomposition for multilevel codes over multilevel and partial erasure channels, An accurate density evolution analysis for a finite-state Markov channel, Cospectral bipartite graphs with the same degree sequences but with different number of large cycles, A branch-cut-and-price algorithm for optimal decoding in digital communication systems, Graph-based channel detection for multitrack recording channels, Photonic circuits for iterative decoding of a class of low-density parity-check codes, A New Approach to Laplacian Solvers and Flow Problems, Gallager error-correcting codes for binary asymmetric channels, Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains, Weighted enumeration of spanning subgraphs in locally tree-like graphs, Analysis of the dynamics of iterative interference cancellation in iterative decoding, Prediction errors for penalized regressions based on generalized approximate message passing
