NUI Maynooth

NUI Maynooth ePrints and eTheses Archive

NUIM Library

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]PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
206Kb

Abstract

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.

Keywords:Optimal rateless codes; Bernoulli(1/2) random variables; Mitzenmacher; Hamilton Institute.
Subjects:Science & Engineering > Hamilton Institute
ID Code:1684
Deposited By:Hamilton Editor
Deposited On:25 Nov 2009 14:27
Journal or Publication Title: Communication, Control, and Computing, 2008 46th Annual Allerton
Refereed:Yes

Repository Staff Only: item control page