loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)
LT Codes
Vancouver, BC, Canada
November 16-November 19
ISBN: 0-7695-1822-2
ASCII Text
x 
 
Michael Luby, "LT Codes," Foundations of Computer Science, IEEE Annual Symposium on, pp. 271, The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.2002.1181950,
author = {Michael Luby},
title = {LT Codes},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {2002},
issn = {0272-5428},
pages = {271},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181950},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - LT Codes
SN - 0272-5428
SP
EP
A1 - Michael Luby,
PY - 2002
KW - erasure codes
KW - rateless codes
KW - universal codes
KW - reliable transport
KW - balls and bins
KW - randomized algorithms
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Michael Luby, Digital Fountain, Inc.
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
Index Terms:
erasure codes, rateless codes, universal codes, reliable transport, balls and bins, randomized algorithms
Citation:
Michael Luby, "LT Codes," focs, pp.271, The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.