Delay-Optimal Burst Erasure Codes for Parallel Links

摘要：

Motivated by live streaming applications using peer assistance, we study burst erasure correction codes with optimal decoding delay for parallel-link networks. We consider a new model for network error correction, where each source symbol is decoded at the sink on-the-fly with a strict decoding deadline. We distinguish two types of errors which have very different implications on the code design - erasure burst and link outage. For a class of codes that achieve the Singleton bound, we state a theorem that characterizes the fundamental tradeoff among the coding rate, decoding delay and error correction performance, whose achievability is illustrated by a practical code construction.

作者: Zhi Li Ali C.Begen Bernd Girod

作者单位: Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA Cisco Systems, 170 West Tasman Drive, San Jose, CA 95134, USA

会议类型: 国际会议

会议名称: 2011 International Symposium on Network Coding(2011网络编码国际会议 NETCOD 2011)

会议地点: 北京

会议语种:英文

页码: 1-6

在线出版日期: 2011-07-25（万方平台首次上网日期，不代表论文的发表时间）