On a class of optimal rateless codes

Subramanian, Vijay G. and Leith, Douglas J. (2008) On a class of optimal rateless codes. In: Conference on Communication, Control, and Computing, 2008 46th Annual Allerton , 23-26 Sept 2008.

[img] Download (211kB)

Share your research

Twitter Facebook LinkedIn GooglePlus Email more...

Add this article to your Mendeley library


Abstract—In this paper we analyze a class of systematic fountain/rateless codes constructed using Bernoulli(1=2) random variables. Using simple bounds we then show that this class of codes stochastically minimizes the number of coded packets receptions needed to successfully decode all the information packets. This optimality holds over a large class of random codes that includes Bernoulli(q) random codes with q ≤ 1/2 and LT codes. We then conclude by demonstrating asymptotic optimality for intermediate decoding of the same codes.

Item Type: Conference or Workshop Item (Paper)
Keywords: Optimal rateless codes; Bernoulli(1/2) random variables; Mitzenmacher; Hamilton Institute.
Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID: 1684
Depositing User: Hamilton Editor
Date Deposited: 25 Nov 2009 14:27
Journal or Publication Title: Communication, Control, and Computing, 2008 46th Annual Allerton
Refereed: Yes

    Repository Staff Only(login required)

    View Item Item control page

    Document Downloads

    More statistics for this item...