A linear time erasure-resilient code with nearly optimal recovery

@article{Alon1996ALT,
  title={A linear time erasure-resilient code with nearly optimal recovery},
  author={Noga Alon and Michael Luby},
  journal={IEEE Trans. Information Theory},
  year={1996},
  volume={42},
  pages={1732-1736}
}
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

283 Citations

0102030'96'01'07'13'19
Citations per Year
Semantic Scholar estimates that this publication has 283 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Problems in complexity in the theory of correcting codes ” , Problems of information transmission Performance evaluation of forward error correction in ATM networks ”

  • L. A. Bassalygo, V. V. Zyablov, M. S. Pinsker
  • The Probabilistic Method
  • 1991

Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators

  • G. A. Margulis
  • Problemy Peredachi Informatsii,
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…