Efficient erasure correcting codes
Citations Over TimeTop 1% of 2001 papers
Abstract
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully with high probability. By carefully designing these graphs we can construct for any given rate R and any given real number /spl epsiv/ a family of linear codes of rate R which can be encoded in time proportional to ln(1//spl epsiv/) times their block length n. Furthermore, a codeword can be recovered with high probability from a portion of its entries of length (1+/spl epsiv/)Rn or more. The recovery algorithm also runs in time proportional to n ln(1//spl epsiv/). Our algorithms have been implemented and work well in practice; various implementation issues are discussed.
Related Papers
- Regularized Variable-Node LT Codes with Improved Erasure Floor Performance(2013)
- → Linear-programming decoding of Tanner codes with local-optimality certificates(2012)2 cited
- → LT codes on partial erasure channels(2017)1 cited
- → Rateless codes erasure correcting with two feedback for cooperative relay(2013)
- → On Tanner Graph Error-Detection of Some Codes due to (123)/ (132)-Avoiding Patterns of AUNU Numbers(2018)