{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T03:07:33Z","timestamp":1785467253149,"version":"3.56.0"},"reference-count":75,"publisher":"Emerald","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,6,25]]},"abstract":"<jats:p>This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition coding, and capacity converses by introducing progressively more sophisticated tools for a selection of source and channel models. The problems addressed include: Source Coding; Rate-Distortion and Multiple Descriptions; Capacity-Cost; The Slepian\u2013Wolf Problem; The Wyner-Ziv Problem; The Gelfand-Pinsker Problem; The Broadcast Channel; The Multiaccess Channel; The Relay Channel; The Multiple Relay Channel; and The Multiaccess Channel with Generalized Feedback. The survey also includes a review of basic probability and information theory.<\/jats:p>","DOI":"10.1561\/0100000028","type":"journal-article","created":{"date-parts":[[2008,7,4]],"date-time":"2008-07-04T16:18:54Z","timestamp":1215188334000},"page":"265-444","source":"Crossref","is-referenced-by-count":138,"title":["Topics in Multi-User Information Theory"],"prefix":"10.1108","volume":"4","author":[{"given":"Gerhard","family":"Kramer","sequence":"first","affiliation":[{"name":"Bell Laboratories , Alcatel-Lucent, 600 Mountain Avenue, Murray Hill, New Jersey, 07974,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2008,6,25]]},"reference":[{"key":"2026032712072482900_ref001","first-page":"23","volume-title":"Proceedings of 2nd International Symposium Information Theory (1971)","author":"Ahlswede","year":"1973"},{"key":"2026032712072482900_ref002","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"2026032712072482900_ref003","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"Alon","year":"2000","edition":"Second"},{"key":"2026032712072482900_ref004","first-page":"334","volume-title":"Proceedings of IEEE International Symposium on Information Theory","author":"Amraoui","year":"2002"},{"key":"2026032712072482900_ref005","volume-title":"Information Flow in Relay Networks","author":"Aref","year":"1980"},{"key":"2026032712072482900_ref006","first-page":"171","volume-title":"The Information Theory Approach to Communications","author":"Berger","year":"1978"},{"issue":"2","key":"2026032712072482900_ref007","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TIT.1973.1054980","article-title":"Random coding theorem for broadcast channels with degraded components","volume":"19","author":"Bergmans","year":"1973","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712072482900_ref008","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/TIT.1974.1055184","article-title":"A simple converse for broadcast channels with additive white Gaussian noise","volume":"20","author":"Bergmans","year":"1974","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712072482900_ref009","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TIT.1965.1053768","article-title":"The convolution inequality for entropy powers","volume":"11","author":"Blachman","year":"1965","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref010","volume-title":"Proceedings of IEEE International Symposium on Information Theory","author":"Bross","year":"2008"},{"issue":"6","key":"2026032712072482900_ref011","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TIT.1982.1056587","article-title":"Multiple-access channels with different generalized feedback signals","volume":"28","author":"Carleial","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712072482900_ref012","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/TIT.2002.1003844","article-title":"The Gaussian watermarking game","volume":"48","author":"Cohen","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712072482900_ref013","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TIT.1983.1056659","article-title":"Writing on dirty paper","volume":"29","author":"Costa","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712072482900_ref014","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/TIT.1975.1055356","article-title":"A proof of the data compression theorem of Slepian and Wolf for ergodic sources","volume":"21","author":"Cover","year":"1975","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712072482900_ref015","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast channels","volume":"18","author":"Cover","year":"1972","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712072482900_ref016","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712072482900_ref017","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TIT.1981.1056357","article-title":"An achievable rate region for the multiple-access channel with feedback","volume":"27","author":"Cover","year":"1981","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref018","volume-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"2026032712072482900_ref019","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Channels","author":"Csisz\u00e1r","year":"1981"},{"key":"2026032712072482900_ref020","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1103031","article-title":"Information transmission in a channel with feedback","volume":"34","author":"Dobrushin","year":"1958","journal-title":"Theory of Probabilistic Applications"},{"issue":"3","key":"2026032712072482900_ref021","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1109\/TIT.1982.1056502","article-title":"The capacity of the semideterministic relay channel","volume":"28","author":"Aref","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712072482900_ref022","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TIT.1982.1056588","article-title":"Achievable rates for multiple descriptions","volume":"28","author":"El Gamal","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712072482900_ref023","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TIT.1981.1056302","article-title":"A proof of Marton\u2019s coding theorem for the discrete memoryless broadcast channel","volume":"27","author":"El Gamal","year":"1981","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref024","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","journal-title":"Canadian Journal of Mathematics"},{"issue":"1","key":"2026032712072482900_ref025","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TIT.1975.1055312","article-title":"The capacity region of a multiple-access discrete memoryless channel can increase with feedback","volume":"21","author":"Gaarder","year":"1975","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref026","volume-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1968"},{"issue":"3","key":"2026032712072482900_ref027","first-page":"3","article-title":"Capacity and coding for degraded broadcast channels","volume":"10","author":"Gallager","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"issue":"1","key":"2026032712072482900_ref028","first-page":"19","article-title":"Coding for channels with random parameters","volume":"9","author":"Gel\u2019fand","year":"1980","journal-title":"Problems of Control and Information Theory"},{"issue":"3","key":"2026032712072482900_ref029","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/18.915637","article-title":"Rate-splitting multiple-access for discrete memoryless channels","volume":"47","author":"Grant","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"issue":"8","key":"2026032712072482900_ref030","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1109\/TIT.2003.814480","article-title":"Towards an information theory of large networks: An achievable rate region","volume":"49","author":"Gupta","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref031","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"Horn","year":"1985"},{"issue":"8","key":"2026032712072482900_ref032","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1109\/TIT.2004.831790","article-title":"A conditional entropy power inequality for dependent random variables","volume":"50","author":"Johnson","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref033","doi-asserted-by":"crossref","DOI":"10.1142\/p341","volume-title":"Information Theory and the Central Limit Theorem","author":"Johnson","year":"2004"},{"key":"2026032712072482900_ref034","volume-title":"Multiple Access Channels with Generalized Feedback","author":"King","year":"1978"},{"issue":"1","key":"2026032712072482900_ref035","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TIT.1977.1055655","article-title":"General broadcast channels with degraded message sets","volume":"23","author":"K\u00f6rner","year":"1977","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref036","volume-title":"Directed Information for Channels with Feedback","author":"Kramer","year":"1998"},{"issue":"1","key":"2026032712072482900_ref037","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TIT.2002.806135","article-title":"Capacity results for the discrete memoryless network","volume":"49","author":"Kramer","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712072482900_ref038","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1109\/TIT.2005.853304","article-title":"Cooperative strategies and capacity theorems for relay networks","volume":"51","author":"Kramer","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3\u20134","key":"2026032712072482900_ref039","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1561\/1300000004","article-title":"Cooperative communications","volume":"1","author":"Kramer","year":"2006","journal-title":"Foundations and Trends in Networking"},{"issue":"1","key":"2026032712072482900_ref040","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10922-005-9019-0","article-title":"Edge-cut bounds on network coding rates","volume":"14","author":"Kramer","year":"2006","journal-title":"Journal of Network and Systems Management"},{"issue":"10","key":"2026032712072482900_ref041","doi-asserted-by":"crossref","first-page":"3517","DOI":"10.1109\/TIT.2007.904962","article-title":"Rate regions for relay broadcast channels","volume":"53","author":"Liang","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref042","volume-title":"Proceedings of IEEE International Symposium on Information Theory","author":"Liao","year":"1972"},{"issue":"3","key":"2026032712072482900_ref043","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TIT.1979.1056046","article-title":"A coding theorem for the discrete memoryless broadcast channel","volume":"25","author":"Marton","year":"1979","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref044","volume-title":"Applied Digital Information Theory","author":"Massey","year":"1980\u20131998"},{"key":"2026032712072482900_ref045","first-page":"27","volume-title":"Proceedings of IEEE International Symposium on Information Theory Applications","author":"Massey","year":"1990"},{"issue":"3","key":"2026032712072482900_ref046","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/18.915643","article-title":"Coding for computing","volume":"47","author":"Orlitsky","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712072482900_ref047","doi-asserted-by":"crossref","first-page":"1909","DOI":"10.1002\/j.1538-7305.1980.tb03344.x","article-title":"On a source-coding problem with two channels and three receivers","volume":"59","author":"Ozarow","year":"1980","journal-title":"Bell System Technical Journal"},{"issue":"4","key":"2026032712072482900_ref048","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/TIT.1984.1056935","article-title":"The capacity of the white Gaussian multiple access channel with feedback","volume":"30","author":"Ozarow","year":"1984","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref049","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"issue":"1","key":"2026032712072482900_ref050","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/TIT.2003.821998","article-title":"n-channel symmetric multipledescriptions \u2014 Part I: (n,k) source-channel erasure codes","volume":"50","author":"Pradhan","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712072482900_ref051","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1109\/TIT.2005.844063","article-title":"n-channel symmetric multipledescriptions \u2014 Part II: an achievable rate-distortion region","volume":"51","author":"Puri","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712072482900_ref052","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/18.910578","article-title":"Design of capacityapproaching low-density parity-check codes","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712072482900_ref053","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/18.485709","article-title":"A rate-splitting approach to the Gaussian multiple-access channel","volume":"42","author":"Rimoldi","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712072482900_ref054","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/TIT.1978.1055883","article-title":"An outer bound to the capacity region of broadcast channels","volume":"24","author":"Sato","year":"1978","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref055","first-page":"379","volume-title":"Bell System Technical Journal","author":"Shannon","year":"1948"},{"key":"2026032712072482900_ref056","first-page":"221","volume-title":"IRE Transaction Information Theory","author":"Shannon","year":"1956"},{"key":"2026032712072482900_ref057","first-page":"142","volume-title":"IRE International Convention Record","author":"Shannon","year":"1959"},{"key":"2026032712072482900_ref058","first-page":"611","volume-title":"Proceedings of 4th Berkeley Symposium on Mathematical Statistics and Probability","author":"Shannon","year":"1961"},{"key":"2026032712072482900_ref059","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1002\/j.1538-7305.1973.tb02004.x","article-title":"A coding theorem for multiple access channels with correlated sources","volume":"52","author":"Slepian","year":"1973","journal-title":"Bell System Technical Journal"},{"issue":"9","key":"2026032712072482900_ref060","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless coding of correlated information sources","volume":"19","author":"Slepian","year":"1973","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref061","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0019-9958(59)90348-1","article-title":"Some inequalities satisfied by the quantities of information of Fisher and Shannon","volume":"2","author":"Stam","year":"1959","journal-title":"Information Control"},{"issue":"6","key":"2026032712072482900_ref062","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1002\/ett.4460100604","article-title":"Capacity of multi-antenna Gaussian channels","volume":"10","author":"Telatar","year":"1999","journal-title":"European Transactions on Telecommunication"},{"key":"2026032712072482900_ref063","volume-title":"Transmission of Information in a T-Terminal Discrete Memoryless Channel","author":"van der Meulen","year":"1968"},{"issue":"9","key":"2026032712072482900_ref064","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1109\/TIT.2003.815767","article-title":"Multiple description coding with many channels","volume":"49","author":"Venkataramani","year":"2003","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712072482900_ref065","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1109\/TIT.2007.896880","article-title":"Vector Gaussian multiple-description for individual and central receivers","volume":"53","author":"Wang","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712072482900_ref066","doi-asserted-by":"crossref","first-page":"3936","DOI":"10.1109\/TIT.2006.880064","article-title":"The capacity region of the Gaussian multiple-input multiple-output broadcast channel","volume":"52","author":"Weingarten","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref067","volume-title":"Information Theoretical Results for the Discrete Memoryless Multiple Access Channel","author":"Willems","year":"1982"},{"issue":"3","key":"2026032712072482900_ref068","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TIT.1985.1057042","article-title":"The discrete memoryless multipleaccess channel with cribbing encoders","volume":"31","author":"Willems","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712072482900_ref069","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/TIT.1973.1055108","article-title":"A theorem on the entropy of certain binary sequences and applications: Part II","volume":"19","author":"Wyner","year":"1973","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712072482900_ref070","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TIT.1973.1055107","article-title":"A theorem on the entropy of certain binary sequences and applications: Part I","volume":"19","author":"Wyner","year":"1973","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712072482900_ref071","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1976.1055508","article-title":"The rate-distortion function for source coding with side information at the decoder","volume":"22","author":"Wyner","year":"1976","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712072482900_ref072","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/TIT.2004.826631","article-title":"A network information theory for wireless communication: scaling laws and optimal operation","volume":"50","author":"Xie","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712072482900_ref073","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TIT.2005.844066","article-title":"An achievable rate for the multiple-level relay channel","volume":"51","author":"Xie","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712072482900_ref074","first-page":"302","volume-title":"Proceedings of 2001 IEEE International Symposium Information Theory","author":"Yu","year":"2001"},{"issue":"4","key":"2026032712072482900_ref075","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1109\/TIT.1987.1057330","article-title":"New results in binary multiple descriptions","volume":"33","author":"Zhang","year":"1987","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/4\/4-5\/265\/11153662\/0100000028en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/4\/4-5\/265\/11153662\/0100000028en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:35Z","timestamp":1777471835000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/4\/4-5\/265\/1332374\/Topics-in-Multi-User-Information-Theory"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,25]]},"references-count":75,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2008,6,25]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000028","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,25]]}}}