Fountain capacity

IEEE Transactions on Information Theory

Volumn 53, Issue 11, 2007, Pages 4372-4376

  Shamai, Shlomo ^a   Telatar, I Emre ^b   Verdú, Sergio ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b EPFL   (Switzerland)

^c Princeton University   (United States)

Author keywords

Arbitrarily varying channels; Channel capacity; Content distribution; Erasure channels; Fountain codes

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS); SIGNAL RECEIVERS;

CONTENT DISTRIBUTION; ERASURE CHANNELS; FOUNTAIN CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 36349014400     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.907495     Document Type: Article

References (21)

1. M. G. Luby, "LT codes," in Proc. 43rd IEEE Symp. Foundations of Computer Science, Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
2. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
3. P. Pakzad and A. Shokrollah, "Design principles for raptor codes," in Proc. 2006 IEEE Information Theory Workshop, Punta del Este, Uruguay, Mar. 2006, pp. 165-169.
4. O. Etesami and A. Shokrollah, "Raptor codes on binary memoryless symmetric channels," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 2033-2051, May 2006.
5. R. Palanki and J. Yedidia, "Rateless codes on noisy channels," in Proc. 2004 IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 37.
6. U. Erez, M. D. Trott, and G. W. Wornell, "Rateless coding for Gaussian channels and perfect incremental redundancy," in Proc. Information Theory and Applications Workshop, San Diego, Feb. 2006.
7. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
8. Press Release: Digital Fountain, Inc., 2005 HOnline]. Available: http:// www.digitalfountain.com/technology/standards/index.cfm
9. Multimedia Broadcast/Multicast Service (MBMS); Protocols and Codecs. [Online]. Available: http://www.3gpp.org/ftp/Specs/html-info/26346.htm
10. Caire, S. Shamai (Shitz), A. Shokrollahi, and S. Verdú, "Fountain codes for lossless compression of binary sources," in Proc. 2004 IEEE Workshop on Information Theory, San Antonio, TX, Oct. 2004.
11. T. M. Cover, "Comments on broadcast channels," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2524-2530, Oct. 1998.
12. N. Shulman and M. Feder, "Static broadcasting," in Proc. 2000 IEEE Int. Symp. Information Theory, Sorrento, Italy, Jun. 2000, p. 23.
13. M. Feder and N. Shulman, "Source broadcasting with unknown amount of receiver side information," in Proc. 2002 IEEE Information Theory Workshop, Bangalore, India, Oct. 2002, pp. 127-130.
14. S. Verdú and T. Weissman, The Information Lost in Erasures, 2007, submitted for publication.
15. A. M. Tulino, S. Verdú, G. Caire, and S. Shamai, "The Gaussian-erasure channel," in Proc. IEEE 2007 Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1721-1725.
16. T. Cover and S. Pombra, "Gaussian feedback capacity," IEEE Trans. Inf. Theory, vol. 35, no. 1, pp. 37-43, Jan. 1989.
17. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
18. A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2148-2177, Oct. 1998.
19. S. Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147-1157, Jul. 1994.
20. J. L. Doob, Stochastic Processes. New York: Wiley, 1953.
21. S. Verdú, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1019-1030, Sep. 1990.