Windowed Erasure Codes

@article{Studholme2006WindowedEC,
  title={Windowed Erasure Codes},
  author={Chris Studholme and Ian F. Blake},
  journal={2006 IEEE International Symposium on Information Theory},
  year={2006},
  pages={509-513}
}
The design of erasure correcting codes and their decoding algorithms is now at the point where capacity achieving codes are available with decoding algorithms that have complexity that is linear in the number of information symbols. One aspect of these codes is that the overhead (number of coded symbols beyond the number of information symbols required to achieve decoding completion with high probability) is linear in k. This work considers a new class of random codes which have the following… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Extended LT decoder based on extra ripples

  • 2017 Iranian Conference on Electrical Engineering (ICEE)
  • 2017
VIEW 1 EXCERPT
CITES METHODS

LT code : decoding algorithm and its applications

VIEW 2 EXCERPTS
CITES METHODS & RESULTS

Improving LT Decoding for Real-Time Applications

  • 2014 IEEE 79th Vehicular Technology Conference (VTC Spring)
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND

LT-W: Improving LT Decoding With Wiedemann Solver

  • IEEE Transactions on Information Theory
  • 2013
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Random graphs

  • Encyclopedia of mathematics and its applications
  • 1998
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On the distribution of rank of a random matrix over a finite field, Random Structures and Algorithms

Colin Cooper
  • 2000
VIEW 1 EXCERPT