The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
[article]
2008
arXiv
pre-print
In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check matrix of an LDPC code and developing an optimized parity-check matrix, with the same performance on the memory-less erasure channel, and suitable also for the iterative correction of single bursts of erasures. The parity-check matrix optimization is performed
arXiv:0810.1197v1
fatcat:26oz637cxvb2bfptgazjaljdpe