Design of capacity-approaching irregular low-density parity-check codes

DOI10.1109/18.910578zbMath1019.94034OpenAlexW2127490352MaRDI QIDQ4544510

Mohammad Amin Shokrollahi, Ruediger Urbanke, Thomas J. Richardson

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/02746a7981e1e6a8fd252b80e31bf782f5843eec

zbMATH Keywords

upper bound probability densities bipartite graphs Shannon capacity low-density parity-check codes belief propagation turbo codes symmetric channel

Mathematics Subject Classification ID

Applications of graph theory (05C90) Bounds on codes (94B65) Other types of codes (94B60) Error probability in coding theory (94B70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items

LDPC code design for nonuniform power-line channels, Low Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes, Geometric Constructions of Gallager Codes, Long Distance Quantum Key Distribution with Continuous Variables, STUDY OF BIFURCATION BEHAVIOR OF LDPC DECODERS, Enhancing continuous variable quantum key distribution with a heralded hybrid linear amplifier, Analysis of Bayesian inference algorithms by the dynamical functional approach, EXIT analysis of M-algorithm based MIMO detectors and LDPC code design optimization, Basics of Secrecy Coding, Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles, A class of quantum low-density parity check codes by combining seed graphs, On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\), Decoding turbo-like codes via linear programming, A fast BER evaluation method for LDGM codes, Improved construction of LDPC convolutional codes with semi-random parity-check matrices, Constructions of QC LDPC codes based on integer sequences, On tensor products of CSS codes, Comprehensive high-speed reconciliation for continuous-variable quantum key distribution, Probabilistic Amplitude Shaping, Expander graphs and their applications, Parallel versus sequential updating for belief propagation decoding, On analyzing LDPC codes over multiantenna MC-CDMA system, Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes, Estimation and Marginalization Using the Kikuchi Approximation Methods, Error-correcting codes and cryptography, A Spectral Approach to Analysing Belief Propagation for 3-Colouring, Protograph LDPC code design for asynchronous random access, Graph-based convolutional and block LDPC codes, A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio, Codes on graphs: Recent progress, Iterative decoding of LDPC codes: some bounds and properties, A performance analysis of quantum low-density parity-check codes for correcting correlated errors, Channel decomposition for multilevel codes over multilevel and partial erasure channels, Link-Level Aspects, An accurate density evolution analysis for a finite-state Markov channel, Pseudocodeword-free criterion for codes with cycle-free Tanner graph, Bit-optimal decoding of codes whose Tanner graphs are trees, On the hardness of sampling independent sets beyond the tree threshold, Unnamed Item, ENTANGLEMENT-ASSISTED QUANTUM ERROR-CORRECTING CODES CONSTRUCTED FROM IRREGULAR REPEAT ACCUMULATE CODES, Pooling design and bias correction in DNA library screening, Gallager error-correcting codes for binary asymmetric channels, Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis, Moderate-density parity-check codes from projective bundles, Counting short cycles of (c,d)-regular bipartite graphs, ON THE CLASS OF ARRAY-BASED APM-LDPC CODES