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 条
  • [1] ADLER M, 1997, P 5 ISR S THEOR COMP
  • [2] Bloemer Johannes, 1995, An XOR-Based Erasure-Resilient Coding Scheme
  • [3] BYERS J, 1998, P ACM SIGCOMM 98 VAN, P56
  • [4] BYERS J, 2000, P 2 INT WORKSH NETW, P71
  • [5] Byers J., 2002, P ACM SIGCOMM 2002 P
  • [6] Byers J.W., 2002, IEEE J SELECTED AREA
  • [7] BYERS JW, P IEEE INFOCOM 99 NE, P275
  • [8] Floyd S., 1995, P ACM SIGCOMM 95 AUG, P343
  • [9] GEMMELL J, 1997, MSTR9720
  • [10] The performance of TCP/IP for networks with high bandwidth-delay products and random loss
    Lakshman, TV
    Madhow, U
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1997, 5 (03) : 336 - 350
1234