A linear time erasure-resilient code with nearly optimal recovery

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1732-1736

  Alon, Noga ^a,d   Luby, Michael ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Erasure resilient codes; Linear time; Lossy pocket networks; MDS codes; Real time transmission; Redundancy encoding; Reed solomon codes

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DECODING; ENCODING (SYMBOLS); PACKET NETWORKS; REAL TIME SYSTEMS;

ERASURE RESILIENT CODE; LINEAR TIME; MAXIMAL DISTANCE SEPARABLE; REED-SOLOMON CODES;

CODES (SYMBOLS);

EID: 0030287317     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556669     Document Type: Article

References (16)

1. M. Ajtai, J. Komlös, and E. Szemerédi, Deterministic simulation in logspace, in Proc. 19th ACM Symp. Theory Comput, 1987, pp. 132-140.
2. A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, Priority encoding transmission, in Proc. 35th Ann. Symp. on Foundations of Computer Sciemce, 1994, pp. 604-612, final version: this issue, pp. 1737-1744.
3. A. Albanese, J. Blömer, J. Edmonds, and M. Luby, Priority encoding transmission, ICSI Tech. Rep. TR-94-039, Aug. 1994.
4. N. Alon, J. Edmonds, and M. Luby, Linear time erasure codes with nearly optimal recovery, in Proc. 36th Ann. Symp. on Foundations of Computer Science 1995, pp. 512-519.
5. N. Alon, J. Brück, J. Naor, M. Naor, and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudorandom graphs, IEEE Trans. Inform. Theory, vol. 38, pp. 509-516, 1992.
6. N. Alon and F. R. K. Chung, Explicit construction of linear sized tolerant networks, Discr. Math., vol. 72, pp. 15-19, 1988; also, in Proc. 1st Japan Conf. on Graph Theory and Applications (Hakone, Japan, 1986).
7. N. Alon and J. H. Spencer, The Probabilistic Method. New York: Wiley, 1991.
8. L. A. Bassalygo, V. V. Zyablov, and M. S. Pinsker, Problems in complexity in the theory of correcting codes, Probl. Inform. Transm., vol. 3, pp. 166-175, 1977.
9. E. Biersack, Performance evaluation of forward error correction in AIM networks, in Proc. SIGCOMM '92 (Baltimore, MD, 1992.).
10. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison Wesley, 1983.
11. A. Lubotzky, R. Phillips, and P. Sarnak, Explicit expanders and the Ramanujan conjectures, in Proc. 18th ACM Symp. on Theory Comput, 1986,' pp. 240-246; also: A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, vol. 8, pp. 261-277, 1988.
12. G. A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, Probl. Pered. Inform., vol. 24, pp. 51-60, 1988, in Russian (English transi.: Probl. Inform. Transm., vol. 24, pp. 39-46, 1988).
13. F. J. Macwilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands:: North Holland, 1977.
14. M. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J. Assoc. Comput. Mäch., vol. 36, no. 2, pp. 335-348, Apr. 1989.
15. M. Sipser and D. Spielman, Expander codes, in Proc. 35th Ann. Symp. on Foundations of Computer Science, 1994, pp. 566-576.
16. D. Spielman, Linear-time encodable and decodable error-correcting codes, in Proc. 27th ACM Symp. on Theory of Computation. ACM Press, 1995, pp. 388-397.