@article{b555e2591f5d440bbcc6bc2c51ceb561,
title = "Rateless coding for gaussian channels",
abstract = "A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. We show by construction that perfect rateless codes with low-complexity decoding algorithms exist for additive white Gaussian noise channels. Our construction involves the use of layered encoding and successive decoding, together with repetition using time-varying layer weights. As an illustration of our framework, we design a practical three-rate code family. We further construct rich sets of near-perfect rateless codes within our architecture that require either significantly fewer layers or lower complexity than their perfect counterparts. Variations of the basic construction are also developed, including one for time-varying channels in which there is no a priori stochastic model.",
keywords = "Hybrid ARQ (H-ARQ), Incremental redundancy, Rate-compatible punctured codes, Static broadcasting",
author = "Uri Erez and Trott, {Mitchell D.} and Wornell, {Gregory W.}",
note = "Funding Information: Manuscript received August 20, 2007; revised December 20, 2010; accepted September 16, 2011. Date of current version February 08, 2012. This work was supported in part by the National Science Foundation under Grant CCF-0515122, Draper Laboratory, MITRE Corp., and by Hewlett-Packard Co. through the MIT/HP Alliance. This work was presented in part at the Information Theory and Applications Workshop, University of California, San Diego, Feb. 2006, and at the 2006 IEEE International Symposium on Information Theory.",
year = "2012",
month = feb,
doi = "10.1109/TIT.2011.2173242",
language = "אנגלית",
volume = "58",
pages = "530--547",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",
}