Asynchronous Slepian-Wolf coding via source-splitting

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 271-

  Rimoldi, B ^a   Urbanke, R ^b  

^a WASHINGTON UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; SET THEORY; THEOREM PROVING;

SLEPIAN WOLF CODING; SOURCE SPLITTING;

ENCODING (SYMBOLS);

EID: 0030720556     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.613189     Document Type: Conference Paper

References (6)

1. T. M. Cover and J. A. Thomas Elements of Information Theory. New York: Wiley 1991.
2. A. B. Carleial On the Capacity of il.lultiple-Terminal Communication Networks. PhD thesis Stanford University Aug. 1975.
3. B. Rimoldi and R. Urbanke "A rate-splitting approach to the Gaussian multiple-access channel," IEEE Trans. Inform. Theory vol. IT-42 pp. 364-374 Mar. 1996.
4. A. Grant B. Rimoldi R. Urbanke and P. Whiting "On singleuser decoding for the discrete memoryless multiple-access channel," in Proceedings of the 1995 IEEE International Symposium on Information Theory Whistler B.C. Canada p. 448.
5. A. J. Grant and L. K. Rasmussen "A new coding method for the asynchronous multiple access channel," in Proceedings of the 33d Allerton Conference on Communication Control and Computing (Monticello IL) 1995.
6. B. Rimoldi "Generalized time sharing for multiple access channels." presented at ISIT'97.