About priority encoding transmission

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 699-705

  Boucheron, Stéphane ^a,b   Salamatian, Mohammad Reza ^b  

^a IEEE   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Broadcast channels; Coding exponents; Erasure resilient codes; Information spectrum; Priority encoding transmission

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; CRYPTOGRAPHY; HIERARCHICAL SYSTEMS; INFORMATION THEORY; PACKET NETWORKS;

BROADCAST CHANNELS; PRIORITY ENCODING TRANSMISSION (PET);

ENCODING (SYMBOLS);

EID: 0033891241     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825846     Document Type: Article

References (16)

1. A. Albanese, J. Bloemer, J. Edmonds, and M. Luby, "Priority encoding transmission," IEEE Trans. Inform. Theory, vol. 42, pp. 1737-1744, Nov. 1996.
2. E. Biersack, "Performance evaluation of forward error correction in an ATM environment," IEEE J. Select. Areas Commun., vol. 11, pp. 631-640, 1993.
3. V. Paxson, "Measurements and analysis of end-to-end internet traffic," Ph.D. dissertation, Univ. Calif. Berkeley, Feb. 1997.
4. J. D. Gibson, T. Berger, and D. Lindbergh, Digital Compression for Multimedia: Principles and Standards. San Francisco, CA: Morgan Kaufmann, 1998.
5. I. Csiszár and J. Körner, "Information theory: coding theorems for discrete memoryless channels," in Probability and Mathematical Statistics. New York: Academic, 1981.
6. T. Cover, "Broadcast channels," IEEE Trans. Inform. Theory, vol. IT-18, pp. 2-14, 1972.
7. S. Verdù and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inform. Theory, vol. 40, pp. 1147-1157, 1994.
8. J. Körner and K. Marton, "General broadcast channel with degraded message set," IEEE Trans. Inform. Theory, vol. IT-23, pp. 60-64, 1977.
9. T. S. Han, "An information spectrum approach to capacity theorems for the general multiple-access channel," IEEE. Trans. Inform. Theory, vol. 44, pp. 2773-2795, Nov. 1998.
10. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
11. F. R. K. Chung, R. L. Graham, P. Frankl, and J. B. Shearer, "Some intersection theorems for ordered sets and graphs," J. Comb. Theory, Ser. A, vol. 43, pp. 23-37, 1986.
12. S. Boucheron and K. Salamatian, "Codage à protections inégales et diffusion," in Actes du l6ème GRETSI, 1997, pp. 547-550.
13. R. Urbanke and A. D. Wyner, "Packetizing for the erasure broadcast channel with an Internet application," in Int. Conf. Combinatorics, Information Theory and Statistics, 1997, p. 93.
14. J. Körner and A. Sgarro, "Universally attainable error exponents for broadcast channels with degraded message sets," IEEE Trans. Inform. Theory, vol. IT-26, pp. 670-679, Nov. 1980.
15. G. Poltyrev, "Random coding bounds for some broadcast channels," Probl. Pered. Inform., vol. 19, no. 1, pp. 9-20, 1983.
16. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1967.