LT codes

被引：0
作者：
Luby, M
机构：
来源：
FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2002年
关键词：
erasure codes; rateless codes; universal codes; reliable transport; balls and bins; randomized algorithms;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
引用
收藏
页码：271 / 280
页数：10
相关论文
共 32 条
[21]  
NONNENMACHER J, 1997, P INT C COMP COMM CA
[22]  
NONNENMACHER J, 1997, P ACM SIGCOMM 97
[23]  
Nonnenmacher J., 1996, P IFIP 5 INT WORKSH, P135
[24]   EFFICIENT DISPERSAL OF INFORMATION FOR SECURITY, LOAD BALANCING, AND FAULT TOLERANCE [J].
RABIN, MO .
JOURNAL OF THE ACM, 1989, 36 (02) :335-348
[25]   POLYNOMIAL CODES OVER CERTAIN FINITE FIELDS [J].
REED, IS ;
SOLOMON, G .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (02) :300-304
[26]  
RIZZO L, 1997, P HPCS 97 GREEC JUN
[27]  
RIZZO L, 1997, COMPUTER COMMUNI APR
[28]  
SCHOOLER E, 1997, MSTR9725
[29]  
Scott J. Russel, 1945, 14 M BRIT ASS ADV SC, P311
[30]  
Vicisano L, 1998, IEEE INFOCOM SER, P996, DOI 10.1109/INFCOM.1998.662909
1234