Cited By
View all- Beimel ADolev SSinger N(2007)RT oblivious erasure correctingIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2007.89654015:6(1321-1332)Online publication date: 1-Dec-2007
In this paper low-density parity-check (LDPC) codes are designed for burst erasure channels. Firstly, lower bounds for the maximum length erasure burst that can always be corrected with message-passing decoding are derived as a function of the parity-...
This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of so-called semi-random low-density-parity-check (SR-LDPC) codes. Based on a constrained random-scrambling technique, the proposed coding scheme is ...
In this paper, a simple 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 of starting from the parity-check matrix of an LDPC code and ...
Elsevier North-Holland, Inc.
United States