Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes
IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles
IEEE Transactions on Information Theory
Average Coset Weight Distribution of Combined LDPC Matrix Ensembles
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we show that the critical minimum span ratio of stopping sets for the proposed code ensemble is better than that of the conventional one with keeping the same critical exponent of stopping ratio for both ensemble. Furthermore from experimental results, we show that the average minimum span of stopping sets for a solid burst erasure of the proposed codes is larger than that of the conventional ones.