Rank-metric codes for priority encoding transmission with network coding

被引:12
作者
Silva, Danilo [1 ]
Kschischang, Frank R. [1 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
来源
2007 10TH CANADIAN WORKSHOP ON INFORMATION THEORY | 2007年
关键词
D O I
10.1109/CWIT.2007.375706
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The idea of priority encoding transmission (PET), although very useful to provide graceful degradation of performance in the presence of packet loss, presents a challenge when one tries to apply it in a random network coding environment. So far, the only solution proposed relies on the rateless feature of network coding and is therefore not suitable for delay-constrained applications. In this paper, a PET system based on rank-metric codes is proposed. This system can provide strict combinatorial guarantees of recovery. The system is also able to provide forward error correction or corrupt packets that could potentially be introduced by malicious users. Application of the system to streaming media broadcasting is proposed, illustrating the potential practical utility of this approach.
引用
收藏
页码:81 / 84
页数:4
相关论文
共 8 条
[1]   Priority encoding transmission [J].
Albanese, A ;
Blomer, J ;
Edmonds, J ;
Luby, M ;
Sudan, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) :1737-1744
[2]  
Chou P., 2003, ALL C COMM CONTR COM
[3]  
Gabidulin E. M., 1985, Problems of Information Transmission, V21, P1
[4]  
JAIN K, 2005, ACM S PRINC DIST COM, P51
[5]  
KOETTER R, 2007, IN PRESS P IEEE INT
[6]  
Lidl R., 1983, FINITE FIELDS
[7]   Raptor codes [J].
Shokrollahi, Amin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2551-2567
[8]  
SILVA D, 2007, IN PRESS P IEEE INT