Streaming codes for channels with burst and isolated erasures

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 2850-2858

  Badr, Ahmed ^a   Khisti, Ashish ^a   Tan, Wai Tian ^b   Apostolopoulos, John ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL PARAMETER; COMPUTER SEARCH; ERROR CORRECTION CODES; GILBERT-ELLIOTT CHANNEL; LOW DELAY; PERFORMANCE GAIN; RANDOM LINEAR CODES; UPPER BOUND;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 84883076246     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6567095     Document Type: Conference Paper

References (21)

1. E. Martinian, "Dynamic information and constraints in source and channel coding," Ph.D. dissertation, Mass. Instit. of Tech., 2004.
2. E. Martinian and M. Trott, "Delay-optimal burst erasure code construction," in Proc. Int. Symp. Inform. Theory, Nice, France, July 2007.
3. E. Martinian and C.-E. W. Sundberg, "Burst erasure correction codes with low decoding delay," IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2494-2502, 2004.
4. A. Badr, A. Khisti, and E. Martinian, "Diversity embedded streaming erasure codes (DE-SCo): Constructions and optimality," IEEE Journal on Selected Areas in Communications, pp. 1042-1054, 2011.
5. A. Badr, D. Lui, and A. Khisti, "Multicast streaming codes (Mu-SCo) for burst erasure channels," in 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010.
6. Z. Li, A. Khisti, and B. Girod, "Correcting erasure bursts with minimum decoding delay," in 45th Annual Asilomar Conference on Signals, Systems and Computers, 2011.
7. D. Lui, "Coding theorems for delay sensitive communication over bursterasure channels," Master's thesis, University of Toronto, Toronto, ON, Aug. 2011.
8. O. Tekin, T. Ho, H. Yao, and S. Jaggi, "On erasure correction coding for streaming," in ITA, 2012, pp. 221-226.
9. D. Leong and T. Ho, "Erasure coding for real-time streaming," in ISIT, 2012.
10. Y. Li and E. Soljanin, "Rateless codes for single-server streaming to diverse users," CoRR, vol. abs/0912.5055, 2009.
11. S. Kokalj-Filipovic, P. Spasojevic, and E. Soljanin, "Doped fountain coding for minimum delay data collection in circular networks," CoRR, vol. abs/1001.3765, 2010.
12. H. Yao, Y. Kochman, and G. W. Wornell, "A multi-burst transmission strategy for streaming over blockage channels with long feedback delay," IEEE Journal on Selected Areas in Communications, vol. 29, no. 10, pp. 2033-2043, 2011.
13. A. Talari and N. Rahnavard, "On the intermediate symbol recovery rate of rateless codes," IEEE Transactions on Communications, vol. 60, no. 5, pp. 1237-1242, 2012.
14. B. N. Vellambi, N. Torabkhani, and F. Fekri, "Throughput and latency in finite-buffer line networks," IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3622-3643, 2011.
15. N. Rahnavard, B. N. Vellambi, and F. Fekri, "Rateless codes with unequal error protection property," IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1521-1532, 2007.
16. D. Vukobratovic, V. Stankovic, D. Sejdinovic, L. Stankovic, and Z. Xiong, "Scalable video multicast using expanding window fountain codes," IEEE Transactions on Multimedia, vol. 11, no. 6, pp. 1094-1104, 2009.
17. S. S. Woo and M. K. Cheng, "Prioritized LT codes," in CISS'08, 2008, pp. 568-573.
18. R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding. Wiley-IEEE Press, 1999.
19. E. O. Elliott, "Estimates of error rates for codes on burst-noise channels," Bell Systems Technical Journal, vol. 42, pp. 1977-1997, 1963.
20. E. N. Gilbert, "Capacity of a burst-noise channel," Bell Systems Technical Journal, vol. 39, pp. 1253-1265, 1960.
21. B. D. Fritchman, "A binary channel characterization using partitioned markov chains," IEEE Transactions on Information Theory, vol. 13, pp. 221-227, 1967.