DocumentCode :
2945222
Title :
On a class of optimal rateless codes
Author :
Subramanian, Vijay G. ; Leith, Douglas J.
Author_Institution :
Hamilton Inst., Nat. Univ. of Ireland, Maynooth, Maynooth
fYear :
2008
fDate :
23-26 Sept. 2008
Firstpage :
418
Lastpage :
425
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 les 1/2 and LT codes. We then conclude by demonstrating asymptotic optimality for intermediate decoding of the same codes.
Keywords :
decoding; random codes; stochastic processes; Bernoulli random variables; information packets; intermediate decoding; optimal rateless codes; stochastic processes; systematic fountain codes; Binary sequences; Decoding; Delay; Filling; Probability distribution; Random variables; Relays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Conference_Location :
Urbana-Champaign, IL
Print_ISBN :
978-1-4244-2925-7
Electronic_ISBN :
978-1-4244-2926-4
Type :
conf
DOI :
10.1109/ALLERTON.2008.4797588
Filename :
4797588
Link To Document :
بازگشت