Coding over an erasure channel with a large alphabet size

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1053-1057

  Fashandi, Shervan ^a   Gharan, Shahab Oveis ^a   Khandani, Amir K ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET-SIZE; BLOCK SIZES; ERASURE CHANNEL; ERROR EXPONENTS; INTERNATIONAL SYMPOSIUM; MAXIMUM DISTANCE SEPARABLE CODES; MAXIMUM LIKELIHOOD DECODING; MDS CODES; MINIMUM PROBABILITY OF ERROR; OPTIMALITY; RANDOM CODING; WITH OR WITHOUT;

CODES (STANDARDS); CYBERNETICS; DECODING; INFORMATION THEORY; PROGRAMMING THEORY; RANDOM PROCESSES; TECHNICAL PRESENTATIONS;

CODES (SYMBOLS);

EID: 52349083003     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595148     Document Type: Conference Paper

References (22)

1. W. T. Tan and A. Zakhor, "Video Multicast Using Layered FEC and Scalable Compression," IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, no. 3, pp. 373-386, 2001.
2. L. Dairaine, L. Lancrica, J. Lacan, and J. Fimes, "Content-Access QoS in Peer-to-Peer Networks Using a Fast MDS Erasure Code," Elsevier Computer Communications, vol. 28, no. 15, pp. 1778-1790, 2005.
3. C. E. Shannon, "A Mathematical Theory of Communications," Bell Systems Technical Journal, vol. 27, pp. 379-423, 623-656, 1948.
4. P. Elias, "Coding for Noisy Channels," IRE Convention Record, vol. 4, pp. 37-46, 1955.
5. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to Error Probability for Coding on Discrete Memoryless Channels," Information and Control, vol. 10, pp. 65-103, 522-552, 1967.
6. R. G. Gallager, Information Theory and Reliable Communication, 1st ed. New York, NY, USA: John Wiley & Sons, 1968, pp. 135-144.
7. _, Information Theory and Reliable Communication, 1st ed. New York, NY, USA: John Wiley & Sons, 1968, pp. 157-158.
8. G. Forney, "Exponential Error Bounds for Erasure, List, and Decision Feedback Schemes," IEEE Transactions on Information Theory, vol. 14, no. 2, pp. 206-220, 1968.
9. Ron M. Roth, Introduction to Coding Theory, 1st ed. Cambridge University Press, 2006, pp. 333-351.
10. X. H. Peng, "Erasure-control Coding for Distributed Networks," IEE Proceedings on Communications, vol. 152, pp. 1075-1080, 2005.
11. N. Alon, J. Edmonds, and M. Luby, "Linear Time Erasure Codes with Nearly Optimal Recovery," in IEEE Symposium on Foundations of Computer Science, Proc. IEEE Vol. 3, 1995, pp. 512-519.
12. J. Justesen, "On the Complexity of Decoding Reed-Solomon Codes," IEEE transactions on information theory, vol. 22, no. 2, pp. 237-238, 1993.
13. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient Erasure Correcting Codes," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 569-584, 2001.
14. M. G. Luby, "LT Codes," in IEEE Symposium on the Foundations of Computer Science (FOCS), 2002, pp. 271-280.
15. A. Shokrollahi, "Raptor Codes," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551-2567, 2006.
16. J. L. Walker, "A New Approach to the Main Conjecture on Algebraicgeometric MDS Codes," Journal of Designs, Codes and Cryptography, vol. 9, no. 1, pp. 115-120, 1996.
17. S. Fashandi, S. Oveisgharan, and A.K. Khandani, "Path Diversity in Packet Switched Networks: Performance Analysis and Rate Allocation," in IEEE Global Telecommunications Conference, GLOBECOM'07, 2007, pp. 1840-1844.
18. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE transactions on Networking, vol. 11, no. 5, pp. 782-795, 2003.
19. P. A. Chou, Y. Wu, and K. Jain, "Practical Network Coding," in 51st Allerton Conference on Communication, Control and Computing, 2003.
20. C. Gkantsidis and P. R. Rodriguez, "Network coding for large scale content distribution," in IEEE INFOCOM, Proc. IEEE Vol. 4, 2005, pp. 2235-2245.
21. Ron M. Roth, Introduction to Coding Theory, 1st ed. Cambridge University Press, 2006, pp. 183-204.
22. T. Cover and J. Thomas, Elements of Information Theory, 1st ed. New York: Wiley, 2006, pp. 284-285.