SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
EURASIP Journal on Wireless Communications and Networking
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Generic erasure correcting sets: bounds and constructions
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Rate-adaptive codes for distributed source coding
Signal Processing - Special section: Distributed source coding
Reliable and efficient message delivery in delay tolerant networks using rateless codes
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Generating random graphs with large girth
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Stopping Distance and Stopping Redundancy of Product Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A note on the stopping redundancy of linear codes
Journal of Computer Science and Technology
Geometrically-structured maximum-girth LDPC block and convolutional codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Instanton-based techniques for analysis and reduction of error floors of LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Quasi-systematic doped LT codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
On asymptotic ensemble weight enumerators of LDPC-like codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Finite-length scaling of turbo-like code ensembles on the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Good concatenated code ensembles for the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Eliminating small stopping sets in irregular low-density parity-check codes
IEEE Communications Letters
Construction of near-optimum burst erasure correcting low-density parity-check codes
IEEE Transactions on Communications
Evaluation and design of irregular LDPC codes using ACE spectrum
IEEE Transactions on Communications
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Communications
Architecture-aware LDPC code design for multiprocessor software defined radio systems
IEEE Transactions on Signal Processing
A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel
IEEE Transactions on Information Theory
The trapping redundancy of linear block codes
IEEE Transactions on Information Theory
Finite-length scaling for iteratively decoded LDPC ensembles
IEEE Transactions on Information Theory
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
Reversible low-density parity-check codes
IEEE Transactions on Information Theory
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Upper bound on error exponent of regular LDPC codes transmitted over the BEC
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the stopping distance of array code parity-check matrices
IEEE Transactions on Information Theory
Analysis of connections between pseudocodewords
IEEE Transactions on Information Theory
Single-exclusion number and the stopping redundancy of MDS codes
IEEE Transactions on Information Theory
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices
IEEE Transactions on Information Theory
On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Quasi-systematic doped LT codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Stopping set analysis of repeat multiple-accumulate codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Two-bit message passing decoders for LDPC codes over the binary symmetric channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On the probabilistic computation of the stopping redundancy of LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Decreasing error floor in LDPC codes by parity-check matrix extensions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Waterfall performance analysis of finite-length LDPC codes on symmetric channels
IEEE Transactions on Communications
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices
IEEE Transactions on Communications
Burst erasure correcting LDPC codes
IEEE Transactions on Communications
Finite-length rate-compatible LDPC codes: a novel puncturing scheme
IEEE Transactions on Communications
Minimum distance and pseudodistance lower bounds for generalised LDPC codes
International Journal of Information and Coding Theory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Erasure codes with a banded structure for hybrid iterative-ML decoding
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes
IEEE Transactions on Information Theory
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
IEEE Transactions on Information Theory
Linear time encoding of LDPC codes
IEEE Transactions on Information Theory
Channel coding rate in the finite blocklength regime
IEEE Transactions on Information Theory
Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-Part II
IEEE Transactions on Information Theory
On the number of minimum stopping sets and minimum codewords of array LDPC codes
IEEE Communications Letters
On the dynamics of the error floor behavior in (regular) LDPC codes
IEEE Transactions on Information Theory
Low-density parity-check codes for nonergodic block-fading channels
IEEE Transactions on Information Theory
Capacity-approaching irregular turbo codes for the binary erasure channel
IEEE Transactions on Communications
Burst decoding of cyclic codes based on circulant parity-check matrices
IEEE Transactions on Information Theory
Multiple-bases belief-propagation decoding of high-density cyclic codes
IEEE Transactions on Communications
Systematic design of low-density parity-check code ensembles for binary erasure channels
IEEE Transactions on Communications
Constructing short-length irregular LDPC codes with low error floor
IEEE Transactions on Communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Connectivity reliability of large scale random ad hoc networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Stopping set distributions of algebraic geometry codes from elliptic curves
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Message length adaptive LDPC codes
Digital Signal Processing
| Hi-index | 756.22 |
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probability for regular LDPC ensembles and the standard random ensemble under maximum-likelihood (ML) decoding. Finally, we present what we consider to be the most important open problems in this area