&gt; The only other work that deals with rateless codes that we are aware of is a forthcoming paper [6]
by Luby. Since the author declined to provide us with a copy of his paper, we are unable to compare
our results until his paper becomes public at FOCS’02. The final version of our paper will include
a comparison with Luby’s work.<p>Online Codes: <a href="https:&#x2F;&#x2F;www.cs.nyu.edu&#x2F;media&#x2F;publications&#x2F;TR2002-833.pdf" rel="nofollow">https:&#x2F;&#x2F;www.cs.nyu.edu&#x2F;media&#x2F;publications&#x2F;TR2002-833.pdf</a><p>Rateless Codes and Big Downloads: <a href="https:&#x2F;&#x2F;pdos.csail.mit.edu&#x2F;~petar&#x2F;papers&#x2F;maymounkov-bigdown-lncs.ps" rel="nofollow">https:&#x2F;&#x2F;pdos.csail.mit.edu&#x2F;~petar&#x2F;papers&#x2F;maymounkov-bigdown-...</a> (Start here)