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.
PDF
UniformCodes_AllertonFinalVersion.pdf
Download (211kB)
UniformCodes_AllertonFinalVersion.pdf
Download (211kB)
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.
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 |
URI: | https://mu.eprints-hosting.org/id/eprint/1684 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year