{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:58:53Z","timestamp":1778605133978,"version":"3.51.4"},"reference-count":437,"publisher":"Emerald","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,1,1]]},"abstract":"<jats:p>In this monograph, we develop a mathematical framework based on asymptotically good random structured codes, i.e., codes possessing algebraic properties, for network information theory. We use these codes to propose new strategies for communication in multi-terminal settings. The proposed coding strategies are applicable to arbitrary instances of the multi-terminal communication problems under consideration. In particular, we consider four fundamental problems which can be considered as building blocks of networks: distributed source coding, interference channels, multiple-access channels with distributed states and multiple description source coding. We then develop a systematic framework for characterizing the performance limits of these strategies for these problems from an information-theoretic viewpoint. Lastly, we identify several examples of the multiterminal communication problems studied herein, for which structured codes attain optimality, and provide strictly better performance as compared to classical techniques based on unstructured codes. In summary, we develop an algebraic and probabilistic framework to demonstrate the fundamental role played by structured codes in multiterminal communication problems. This monograph deals exclusively with discrete source and channel coding problems.<\/jats:p>","DOI":"10.1561\/0100000083","type":"journal-article","created":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T09:41:33Z","timestamp":1608543693000},"page":"173-379","source":"Crossref","is-referenced-by-count":14,"title":["An Algebraic and Probabilistic Framework for Network Information Theory"],"prefix":"10.1108","volume":"18","author":[{"given":"S. Sandeep","family":"Pradhan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Padakandla","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Tennessee ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farhad","family":"Shirani","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, North Dakota State University ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2021,1,1]]},"reference":[{"key":"2026032712175888900_ref001","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":". 2011","edition":"Second ed."},{"key":"2026032712175888900_ref002","volume-title":"Elements of Information Theory","author":"Cover","year":"2006","edition":"Second ed."},{"key":"2026032712175888900_ref003","volume-title":"Network Information Theory","author":"Gamal","year":"2012","edition":"First ed."},{"key":"2026032712175888900_ref004","author":"Shannon","year":"1948"},{"key":"2026032712175888900_ref005","first-page":"611","volume-title":"Proc. 4th Berkeley Symp. Math. Statist. Prob","author":"Shannon","year":"1961"},{"key":"2026032712175888900_ref006","author":"Liao","year":"1972"},{"key":"2026032712175888900_ref007","first-page":"1973","author":"Ahlswede","year":"1971","journal-title":"Publishing House of the Hungarian Academy of Science"},{"key":"2026032712175888900_ref008","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1214\/aop\/1176996549","article-title":"The capacity region of a channel with two senders and two receivers","volume":"2","author":"Ahlswede","year":"1974","journal-title":"Ann. Prob."},{"key":"2026032712175888900_ref009","first-page":"216","article-title":"An elementary proof of the strong converse theorem for the multiple-access channel","volume":"7","author":"Ahlswede","year":"1982","journal-title":"J. Comb. Inform. Syst. Sci."},{"issue":"1","key":"2026032712175888900_ref010","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast channels","volume":"IT-18","author":"Cover","year":". 1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref011","author":"Gallager","year":".-. 1974"},{"key":"2026032712175888900_ref012","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":"IT-20","author":"Bergmans","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref013","author":"Shannon","year":"1959"},{"key":"2026032712175888900_ref014","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/18.75242","article-title":"Successive refinement of information","volume":"37","author":"Equitz","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref015","doi-asserted-by":"crossref","first-page":"1681","DOI":"10.1002\/j.1538-7305.1974.tb02812.x","article-title":"Source coding for a simple network","volume":"53","author":"Gray","year":"1974","journal-title":"Bell Syst. Tech. J."},{"key":"2026032712175888900_ref016","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless coding of correlated information sources","volume":"IT-19","author":"Slepian","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref017","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 (corresp.)","volume":"21","author":"Cover","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref018","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1109\/TIT.1975.1055469","article-title":"Source coding with side information and a converse for degraded broadcast channels","volume":"IT-21","author":"Ahlswede","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref019","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":"IT-22","author":"Wyner","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref020","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/S0019-9958(78)90034-7","article-title":"The rate-distortion function for source coding with side information at the decoder-II: General sources","volume":"38","author":"Wyner","year":"1978","journal-title":"Inform. Contr."},{"key":"2026032712175888900_ref021","author":"Berger","year":"1977"},{"issue":"2","key":"2026032712175888900_ref022","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TIT.1977.1055690","article-title":"Source coding with side information at several decoders","volume":"23","author":"Sgarro","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref023","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/TIT.1979.1056105","article-title":"An upper bound on the rate distortion function for source coding with partial side information at the decoder","volume":"IT-25","author":"Berger","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref024","volume-title":"Source coding with side information and universal coding","author":"Gallager","year":". 1979"},{"issue":"1","key":"2026032712175888900_ref025","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0019-9958(80)90284-3","article-title":"Slepian-Wolf-Cover theorem for network of channels","volume":"47","author":"Han","year":"1980","journal-title":"Info. and Contr."},{"key":"2026032712175888900_ref026","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/18.32119","article-title":"Multiterminal source coding with one distortion criterion","volume":"35","author":"Yeung","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref027","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TIT.1973.1054980","article-title":"Random coding theorems for the broadcast channels with degraded components","volume":"IT-15","author":"Bergmans","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref028","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/TIT.1975.1055347","article-title":"Random coding theorems for the general discrete memoryless broadcast channel","volume":"IT-21","author":"Meulen","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref029","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-7091-2730-8_7","volume-title":"Information Theory New Trends and Open Problems","author":"K\u00f6rner","year":"1975"},{"issue":"1","key":"2026032712175888900_ref030","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TIT.1978.1055812","article-title":"Interference channels","volume":"24","author":"Carleial","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref031","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/TIT.1981.1056307","article-title":"A new achievable rate region for the interference channel","volume":"27","author":"Han","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref032","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref033","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TIT.1982.1056588","article-title":"Achievable rates for multiple descriptions","volume":"28","author":"Gamal","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref034","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1002\/j.1538-7305.1980.tb03372.x","article-title":"Source coding for multiple descriptions","author":"Wolf","year":"1980","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"2026032712175888900_ref035","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 Trans. Inform. Theory"},{"issue":"10","key":"2026032712175888900_ref036","doi-asserted-by":"crossref","first-page":"19091921","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 Syst. Tech. J."},{"issue":"2","key":"2026032712175888900_ref037","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1980.1056166","article-title":"Towards a general theory of source networks","volume":"26","author":"Csiszar","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref038","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/TIT.1980.1056192","article-title":"A unified achievable rate region for a general class of multiterminal source coding systems","volume":"26","author":"Han","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref039","author":"Kramer","year":"2008"},{"key":"2026032712175888900_ref040","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TIT.1979.1056022","article-title":"How to encode the modulo-two sum of binary sources (corresp.)","volume":"25","author":"K\u00f6rner","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref041","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.1109\/TIT.2007.904785","article-title":"Computation over multiple-access channels","volume":"53","author":"Nazer","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref042","author":"Sridharan","year":". 2008"},{"key":"2026032712175888900_ref043","doi-asserted-by":"crossref","first-page":"2442","DOI":"10.1109\/TIT.2009.2018174","article-title":"On the loss of single-letter characterization: The dirty multiple access channel","volume":"55","author":"Philosof","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"2026032712175888900_ref044","doi-asserted-by":"crossref","first-page":"5628","DOI":"10.1109\/TIT.2009.2032853","article-title":"Lattices for distributed source coding: Jointly Gaussian sources and reconstruction of a linear function","volume":"55","author":"Krithivasan","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref045","author":"Wagner","year":"2008"},{"key":"2026032712175888900_ref046","doi-asserted-by":"crossref","first-page":"4566","DOI":"10.1109\/TIT.2010.2054590","article-title":"The approximate capacity of the many-to-one and one-to-many Gaussian interference channels","volume":"56","author":"Bresler","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref047","doi-asserted-by":"crossref","first-page":"4855","DOI":"10.1109\/TIT.2013.2259140","article-title":"Interference alignment: From degrees of freedom to constant-gap capacity approximations","volume":"59","author":"Niesen","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref048","doi-asserted-by":"crossref","first-page":"4902","DOI":"10.1109\/TIT.2014.2323234","article-title":"On interference networks over finite fields","volume":"60","author":"Hong","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref049","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/TIT.2010.2090225","article-title":"On distributed compression of linear functions","volume":"57","author":"Wagner","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref050","doi-asserted-by":"crossref","first-page":"4101","DOI":"10.1109\/TIT.2014.2321371","article-title":"On the capacity of the finite field counterparts of wireless interference networks","volume":"60","author":"Krishnamurthy","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref051","doi-asserted-by":"crossref","first-page":"2835","DOI":"10.1109\/TIT.2014.2311809","article-title":"Distributed compression of linear functions: Partial sum-rate tightness and gap to optimal sum-rate","volume":"60","author":"Yang","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref052","first-page":"119","article-title":"Common information is far less than mutual information","volume":"2","author":"G\u00e1cs","year":"1972","journal-title":"Problems Control Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref053","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0128010","article-title":"On sequences of pairs of dependent random variables","volume":"28","author":"Witsenhausen","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"2026032712175888900_ref054","volume-title":"The Theory of ErrorCorrecting Codes","author":"MacWilliams","year":"1977"},{"key":"2026032712175888900_ref055","volume-title":"Principles and Practice of Information Theory","author":"Blahut","year":"1988"},{"key":"2026032712175888900_ref056","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-43119-1","volume-title":"A Survey of Binary Systems","author":"Bruck","year":"1971"},{"key":"2026032712175888900_ref057","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1975.1055346","article-title":"The common information of two dependent random variables","volume":"21","author":"Wyner","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref058","first-page":"161","volume-title":"in 2014 IEEE International Symposium on Information Theory","author":"Kumar","year":"2014"},{"issue":"6","key":"2026032712175888900_ref059","doi-asserted-by":"crossref","first-page":"3238","DOI":"10.1109\/TIT.2014.2315805","article-title":"The lossy common information of correlated sources","volume":"60","author":"Viswanatha","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref060","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4176-8","volume-title":"An Introduction to the Theory of Groups","author":"Rotman","year":"1995"},{"key":"2026032712175888900_ref061","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511755149","volume-title":"Additive Combinatorics","author":"Tao","year":"2006"},{"key":"2026032712175888900_ref062","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3845-2","volume-title":"Additive Number Theory: Inverse Problems and the Geometry of Sumsets","author":"Nathanson","year":"1996"},{"issue":"1","key":"2026032712175888900_ref063","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1112\/S0024609305018102","article-title":"Sets with small sumset and rectification","volume":"38","author":"Green","year":"2006","journal-title":"Bull. Lond. Math. Soc."},{"key":"2026032712175888900_ref064","volume-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1968"},{"key":"2026032712175888900_ref065","author":"Dummit","year":"2004"},{"issue":"2","key":"2026032712175888900_ref066","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1090\/S0002-9947-1940-0002894-7","article-title":"Polyadic groups","volume":"48","author":"Post","year":"1940","journal-title":"Trans. Amer. Math. Soc."},{"key":"2026032712175888900_ref067","volume-title":"Mathematical Methods for Physicists","author":"Arfken","year":"1999"},{"issue":"2","key":"2026032712175888900_ref068","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1090\/S0002-9947-1943-0008892-4","article-title":"Projective planes","volume":"54","author":"Hall","year":"1943","journal-title":"Trans. Amer. Math. Soc."},{"key":"2026032712175888900_ref069","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1968.tb02486.x","article-title":"Group codes for the Gaussian channel","author":"Slepian","year":"1968","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"2026032712175888900_ref070","first-page":"50","article-title":"A lower bound on the number of words of a linear code in an arbitrary sphere with given radius in GFq","volume":"23","author":"Blinovskii","year":"1987","journal-title":"in Russian). Probl. Pered. Inform. (Prob. Inf. Transm."},{"issue":"1","key":"2026032712175888900_ref071","first-page":"31","article-title":"On the theory of group codes","volume":"3","author":"Berman","year":"1967","journal-title":"Kibernetika"},{"key":"2026032712175888900_ref072","first-page":"37","volume":"4","author":"Elias","year":"1955","journal-title":"Record, part"},{"key":"2026032712175888900_ref073","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/1108003","article-title":"Asymptotic optimality of group and systematic codes for some channels","volume":"8","author":"Dobrushin","year":"1963","journal-title":"Theor. Probab. Appl."},{"key":"2026032712175888900_ref074","volume-title":"Coding for a discrete information source with a distortion measure","author":"Goblick","year":"1962"},{"issue":"6","key":"2026032712175888900_ref075","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/TIT.1986.1057249","article-title":"Do most linear codes achieve the Goblick bound on the covering radius?","volume":"IT-32","author":"Delsarte","year":". 1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref076","article-title":"A nonconstructive upper bound on covering radius","volume":"IT-29, no. 3","author":"Cohen","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref077","author":"Chen","journal-title":"California."},{"key":"2026032712175888900_ref078","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1974.1055171","article-title":"Recent results in the Shannon theory","volume":"IT-20","author":"Wyner","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref079","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TIT.1982.1056524","article-title":"Linear codes for sources and source networks: Error exponents, universal coding","volume":"IT-28","author":"Csiszar","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref080","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1109\/TIT.2010.2043781","article-title":"Hash property and coding theorems for sparse matrices and maximum-likelihood coding","volume":"56","author":"Muramatsu","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"2026032712175888900_ref081","doi-asserted-by":"crossref","first-page":"3820","DOI":"10.1109\/TIT.2005.856935","article-title":"Capacity and lattice strategies for canceling known interference","volume":"51","author":"Erez","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref082","first-page":"55","article-title":"Limits for the decoding error probability when linear codes are used in memoryless channels","volume":"3","author":"Gabidulin","year":"1967","journal-title":"Problemy Peredachi Informatsii"},{"issue":"1","key":"2026032712175888900_ref083","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1214\/aoms\/1177693508","article-title":"Group codes do not achieve Shannon\u2019s channel capacity for general discrete channels","volume":"42","author":"Ahlswede","year":"1971","journal-title":"Ann. Math. Statist."},{"key":"2026032712175888900_ref084","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/S0019-9958(71)90775-3","article-title":"Bounds on algebraic code capacities for noisy channels I","author":"Ahlswede","year":"1971","journal-title":"Inform. Contr."},{"key":"2026032712175888900_ref085","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/S0019-9958(71)90783-2","article-title":"Bounds on algebraic code capacities for noisy channels II","author":"Ahlswede","year":"1971","journal-title":"Inform. Contr."},{"key":"2026032712175888900_ref086","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":"IT-27","author":"Cover","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref087","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TIT.1982.1056437","article-title":"The feedback capacity region of a class of discrete memoryless multiple access channels","volume":"IT-28","author":"Willems","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref088","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/18.568695","article-title":"The empirical distribution of good codes","volume":"43","author":"Shamai","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref089","doi-asserted-by":"crossref","first-page":"2037","DOI":"10.1109\/TIT.2009.2015992","article-title":"The capacity of finite abelian group codes over symmetric memoryless channels","volume":"55","author":"Como","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref090","doi-asserted-by":"crossref","first-page":"2399","DOI":"10.1109\/TIT.2015.2407874","article-title":"Abelian group codes for channel coding and source coding","volume":"61","author":"Sahebi","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref091","author":"Lim","year":"2017"},{"key":"2026032712175888900_ref092","author":"Sahebi","year":"2012"},{"key":"2026032712175888900_ref093","first-page":"311","article-title":"Dichteste gitterf\u00f6rmige Lagerung kongruenter K\u00f6rper","author":"Minkowski","year":"1904","journal-title":"Nachr. Ges. Wiss. G\u00f6ttingen"},{"key":"2026032712175888900_ref094","doi-asserted-by":"crossref","first-page":"665","DOI":"10.2307\/2371320","article-title":"The number of circles covering a set","volume":"61","author":"Kershner","year":"1939","journal-title":"Amer. J. Math."},{"key":"2026032712175888900_ref095","volume-title":"Packing and Covering","author":"Rogers","year":"1964"},{"key":"2026032712175888900_ref096","first-page":"811","volume":"43","author":"Kirac","year":"1996","journal-title":"Circuits and Systems II: Analog and Digital Signal Processing"},{"key":"2026032712175888900_ref097","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/TIT.2002.1003821","article-title":"Nested linear\/lattice codes for structured multiterminal binning","volume":"48","author":"Zamir","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref098","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/TIT.2004.834787","article-title":"Achieving 1\/2log1+SNR on the AWGN channel with lattice encoding and decoding","volume":"IT-50","author":"Erez","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref099","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/18.508838","article-title":"On lattice quantization noise","volume":"IT-42","author":"Zamir","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref100","doi-asserted-by":"crossref","first-page":"3401","DOI":"10.1109\/TIT.2005.855591","article-title":"Lattices which are good for (almost) everything","volume":"IT-51","author":"Erez","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref101","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1109\/18.641543","article-title":"Averaging bounds for lattices and linear codes","volume":"IT-43","author":"Loeliger","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref102","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/18.312163","article-title":"On coding without restrictions for the AWGN channel","volume":"40","author":"Poltyrev","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref103","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1109\/18.930913","article-title":"Multiple-description vector quantization with lattice codebooks: Design and analysis","volume":"IT-47","author":"Vaishampayan","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref104","first-page":"2717","volume-title":"in 2008 IEEE International Symposium on Information Theory","author":"Gariby","year":"2008"},{"key":"2026032712175888900_ref105","author":"Krithivasan"},{"issue":"8","key":"2026032712175888900_ref106","doi-asserted-by":"crossref","first-page":"4439","DOI":"10.1109\/TIT.2016.2571719","article-title":"A simple proof for the existence of \u2018good\u2019 pairs of nested lattices","volume":"62","author":"Ordentlich","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref107","doi-asserted-by":"crossref","first-page":"16601686","DOI":"10.1109\/18.556664","article-title":"Convolutional codes over groups","volume":"42","author":"Loeliger","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref108","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/18.259635","article-title":"The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders","volume":"39","author":"Forney","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref109","doi-asserted-by":"crossref","first-page":"4321","DOI":"10.1109\/TIT.2010.2054330","article-title":"Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels","volume":"56","author":"Como","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref110","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1109\/TIT.2003.810622","article-title":"Duality between source coding and channel coding and its extension to the side information case","volume":"49","author":"Pradhan","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref111","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1109\/TIT.2003.810639","article-title":"The duality between information embedding and source coding with side information and some applications","volume":"49","author":"Barron","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref112","author":"Yu","year":". 2003"},{"key":"2026032712175888900_ref113","author":"Wang","year":". 2004"},{"key":"2026032712175888900_ref114","volume-title":"Proc. Int. Symp. on Info. Theory (ISIT) 2001","author":"Chiang","year":". 2001"},{"issue":"1","key":"2026032712175888900_ref115","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TIT.2005.860465","article-title":"On dualities in multiterminal coding problems","volume":"52","author":"Stankovic","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref116","doi-asserted-by":"crossref","first-page":"2986","DOI":"10.1109\/TIT.2006.876355","article-title":"On functional duality in multiuser source and channel coding problems with one-sided collaboration","volume":"52","author":"Pradhan","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref117","first-page":"131","article-title":"Causal interpretation of random variables","volume":"32","author":"Massey","year":"1996","journal-title":"Probl. Inf. Transm. (Russian)"},{"key":"2026032712175888900_ref118","volume-title":"Theory and Practice of Error Control Codes","author":"Blahut","year":"1983"},{"key":"2026032712175888900_ref119","volume-title":"Sphere Packings","author":"Conway","year":"1992"},{"key":"2026032712175888900_ref120","volume-title":"Covering Codes","author":"Cohen","year":"1997"},{"key":"2026032712175888900_ref121","volume-title":"Elementary Number Theory","author":"Jones","year":"2012"},{"issue":"6","key":"2026032712175888900_ref122","doi-asserted-by":"crossref","first-page":"17971801","DOI":"10.1109\/18.165454","article-title":"On the Hamming distance properties of group codes","volume":"38","author":"Forney","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref123","doi-asserted-by":"crossref","first-page":"2568","DOI":"10.1109\/TIT.2002.800480","article-title":"Random codes: Minimum distances and error exponents","volume":"48","author":"Barg","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref124","first-page":"1354","volume-title":"Proc. 2006 IEEE Intl. Symp. on Information Theory","author":"Nazer","year":"2006"},{"key":"2026032712175888900_ref125","author":"Nazer","year":"2008"},{"key":"2026032712175888900_ref126","volume-title":"Proc. of the Information Theory Workshop","author":"Philosof","year":"2008"},{"issue":"7","key":"2026032712175888900_ref127","doi-asserted-by":"crossref","first-page":"4367","DOI":"10.1109\/TIT.2012.2191691","volume":"58","author":"Jafarian","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref128","first-page":"166","volume-title":"in 2010 IEEE International Symposium on Information Theory","author":"Maddah-Ali","year":"2010"},{"issue":"4","key":"2026032712175888900_ref129","doi-asserted-by":"crossref","first-page":"1488","DOI":"10.1137\/07068802X","article-title":"Analysis of serial turbo codes over abelian groups for symmetric channels","volume":"22","author":"Garin","year":"2008","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"2026032712175888900_ref130","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1109\/TIT.2006.871609","article-title":"Slepian-Wolf coding over broadcast channels","volume":"52","author":"Tuncel","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref131","author":"Zamir","year":"1998"},{"key":"2026032712175888900_ref132","volume-title":"Rate-Distortion Theory: A Mathematical Basis for Data Compression","author":"Berger","year":"1971"},{"key":"2026032712175888900_ref133","volume-title":"Multiterminal Source Coding","author":"Tung","year":"1978"},{"key":"2026032712175888900_ref134","first-page":"67","volume-title":"in 2009 43rd Annual Conference on Information Sciences and Systems","author":"Jana","year":"2009"},{"issue":"6","key":"2026032712175888900_ref135","doi-asserted-by":"crossref","first-page":"1908","DOI":"10.1109\/18.340465","article-title":"Universal coding for the Slepian-Wolf data compression system and the strong converse theorem","volume":"40","author":"Oohama","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref136","doi-asserted-by":"crossref","first-page":"1938","DOI":"10.1109\/TIT.2008.920343","article-title":"Rate region of the quadratic Gaussian two-encoder source-coding problem","volume":"54","author":"Wagner","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref137","article-title":"Multiterminal source coding with high resolution","volume":"IT-45","author":"","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref138","first-page":"45","article-title":"Coding of sources on the basis of observations with incomplete information","volume":"15","author":"Gelfand","year":"1979","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712175888900_ref139","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1109\/TIT.1982.1056586","article-title":"Rate-distortion for correlated sources with partially separated encoders","volume":"IT-28","author":"Kaspi","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref140","volume-title":"Proc. IEEE Inform. Theory Workshop (ITW \u201807)","author":"Jana","year":". 2007"},{"key":"2026032712175888900_ref141","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/18.669162","article-title":"The rate-distortion function for the quadratic Gaussian CEO problem","volume":"IT44","author":"Oohama","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref142","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/TIT.2009.2034791","article-title":"The Gaussian many-help-one distributed source coding problem","volume":"56","author":"Tavildar","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref143","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/TIT.2013.2288257","article-title":"Multiterminal source coding under logarithmic loss","volume":"60","author":"Courtade","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref144","doi-asserted-by":"crossref","first-page":"2708","DOI":"10.1109\/TIT.2015.2412543","article-title":"Rate region of the vector Gaussian one-helper source-coding problem","volume":"61","author":"Rahman","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref145","doi-asserted-by":"crossref","first-page":"4035","DOI":"10.1109\/TIT.2011.2145570","article-title":"Distributed ratedistortion with common components","volume":"57","author":"Wagner","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref146","doi-asserted-by":"crossref","DOI":"10.1137\/0406043","article-title":"Interactive communication of balanced distributions and correlated files","volume":"6","author":"Orlitsky","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"2026032712175888900_ref147","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1109\/18.532875","article-title":"Source coding and graph entropies","volume":"42","author":"Alon","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref148","volume":"4","author":"Ahlswede","year":"1979","journal-title":"Syst. Sci."},{"issue":"3","key":"2026032712175888900_ref149","volume":"5","author":"Ahlswede","year":"1980","journal-title":"Syst. Sci."},{"issue":"5","key":"2026032712175888900_ref150","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1109\/TIT.2008.920249","article-title":"An improved outer bound for multiterminal source coding","volume":"54","author":"Wagner","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref151","first-page":"697","volume-title":"in 2008 IEEE International Symposium on Information Theory","author":"Jana","year":"2008"},{"issue":"1","key":"2026032712175888900_ref152","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TIT.2010.2090211","article-title":"A new data processing inequality and its applications in distributed source and channel coding","volume":"57","author":"Kang","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref153","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TIT.1962.1057738","article-title":"Information transmission with additional noise","volume":"8","author":"Dobrushin","year":"1962","journal-title":"IRE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref154","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TIT.1980.1056251","article-title":"Indirect rate distortion problems","volume":"26","author":"Witsenhausen","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref155","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/TIT.1977.1055800","article-title":"Images of a set via two channels and their role in multi-user communication","volume":"23","author":"Korner","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref156","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TIT.1982.1056560","article-title":"Wyner-Ziv theory for a general function of the correlated sources","volume":"IT-28","author":"Yamamoto","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref157","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/TIT.1987.1057384","article-title":"Encoding of correlated observations","volume":"IT-33","author":"Flynn","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref158","volume-title":"Proc. of the 42nd Annual Allerton Conference on Communication, Control and Computing","author":"Feng","year":". 2004"},{"key":"2026032712175888900_ref159","doi-asserted-by":"crossref","first-page":"2762","DOI":"10.1109\/TIT.2004.836707","article-title":"The Wyner-Ziv problem with multiple sources","volume":"IT-50","author":"Gastpar","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref160","first-page":"887","article-title":"The CEO problem","volume":"42","author":"Viswanathan","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref161","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1109\/18.623151","article-title":"The quadratic Gaussian CEO problem","volume":"43","author":"Viswanathan","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref162","first-page":"700","article-title":"Source coding theory for multiterminal communication systems with a remote source","volume":"E-63","author":"Yamamoto","year":"1980","journal-title":"The Transactions of the IECE of Japan"},{"key":"2026032712175888900_ref163","first-page":"117","author":"Prabhakaran","year":"2004"},{"issue":"8","key":"2026032712175888900_ref164","doi-asserted-by":"crossref","first-page":"3385","DOI":"10.1109\/TIT.2008.926389","article-title":"Robust distributed source coding","volume":"54","author":"Chen","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref165","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/TIT.1987.1057272","volume":"33","author":"Han","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref166","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TIT.1981.1056381","article-title":"To get a bit of information may be as hard as to get full information","volume":"27","author":"Ahlswede","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref167","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TIT.1983.1056669","article-title":"On source coding with side information via a multiple-access channel and related problems in multi-user information theory","volume":"29","author":"Ahlswede","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref168","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1109\/TIT.2010.2103852","article-title":"Distributed source coding using abelian group codes: A new achievable rate-distortion region","volume":"57","author":"Krithivasan","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref169","doi-asserted-by":"crossref","first-page":"3188","DOI":"10.1109\/TIT.2008.924720","article-title":"On the Han-Kobayashi region for the interference channel","volume":"54","author":"Chong","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref170","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TIT.1981.1056416","article-title":"The capacity of the Gaussian interference channel under strong interference (corresp.)","volume":"27","author":"Sato","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref171","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/TIT.2004.825249","article-title":"Outer bounds on the capacity of Gaussian interference channels","volume":"50","author":"Kramer","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref172","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TIT.1978.1055884","article-title":"On the capacity region of a discrete two-user channel for strong interference (corresp.)","volume":"24","author":"Sato","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref173","doi-asserted-by":"crossref","first-page":"13451356","DOI":"10.1109\/TIT.2004.828151","article-title":"On achievable rate regions for the Gaussian interference channel","volume":"50","author":"Sason","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref174","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1109\/TIT.1985.1057085","article-title":"On the Gaussian interference channel","volume":"31","author":"Costa","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref175","author":"Costa","year":"2012"},{"issue":"7","key":"2026032712175888900_ref176","doi-asserted-by":"crossref","first-page":"3682","DOI":"10.1109\/TIT.2015.2436056","article-title":"On the corner points of the capacity region of a two-user Gaussian interference channel","volume":"61","author":"Sason","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref177","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2008.2009793","article-title":"A new outer bound and the noisy-interference sum-rate capacity for Gaussian interference channels","volume":"55","author":"Shang","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"2026032712175888900_ref178","doi-asserted-by":"crossref","first-page":"50305044","DOI":"10.1109\/TIT.2010.2059950","article-title":"Capacity regions and sum-rate capacities of vector Gaussian interference channels","volume":"56","author":"Shang","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref179","first-page":"2011","volume":"1-6","author":"Costa","year":"2011","journal-title":"Information Theory and Applications Workshop, pp."},{"key":"2026032712175888900_ref180","author":"Kramer","year":"2006"},{"issue":"5","key":"2026032712175888900_ref181","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TIT.1987.1057340","article-title":"The capacity region of the discrete memoryless interference channel with strong interference","volume":"33","author":"Costa","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref182","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TIT.1982.1056466","article-title":"The capacity region of a class of deterministic interference channels (corresp.)","volume":"28","author":"Gamal","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref183","first-page":"2416","volume-title":"in 2015 IEEE International Symposium on Information Theory (ISIT)","author":"Nair","year":"2015"},{"issue":"4","key":"2026032712175888900_ref184","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/ett.1284","article-title":"The case for structured random codes in network capacity theorems","volume":"19","author":"Nazer","year":"2008","journal-title":"Eur. Trans. Telecomm."},{"issue":"10","key":"2026032712175888900_ref185","doi-asserted-by":"crossref","first-page":"6463","DOI":"10.1109\/TIT.2011.2165816","article-title":"Compute-and-forward: Harnessing interference through structured codes","volume":"57","author":"Nazer","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"2026032712175888900_ref186","doi-asserted-by":"crossref","first-page":"6355","DOI":"10.1109\/TIT.2012.2205217","article-title":"Ergodic interference alignment","volume":"58","author":"Nazer","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref187","doi-asserted-by":"crossref","first-page":"15491571","DOI":"10.1109\/TIT.2019.2956533","article-title":"Homologous codes for multiple access channels","volume":"66","author":"Sen","year":"2020","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref188","article-title":"IEEE Intl","volume":"2013","author":"Padakandla","year":"2013","journal-title":"Symp. on Info. Th. (ISIT)"},{"issue":"1","key":"2026032712175888900_ref189","first-page":"19","article-title":"Coding for channel with random parameters","volume":"19","author":"","year":"1980","journal-title":"Problems Control Inform. Theory"},{"key":"2026032712175888900_ref190","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 Trans. Inform. Theory"},{"issue":"8","key":"2026032712175888900_ref191","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1109\/TIT.2008.926460","article-title":"Communication over MIMO X channels: Interference alignment, decomposition, and performance analysis","volume":"54","author":"Maddah-Ali","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"2026032712175888900_ref192","doi-asserted-by":"crossref","first-page":"3425","DOI":"10.1109\/TIT.2008.926344","volume":"54","author":"Cadambe","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref193","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139045520","volume-title":"Lattice Coding for Signals and Networks","author":"Zamir","year":"2014"},{"issue":"3","key":"2026032712175888900_ref194","doi-asserted-by":"crossref","first-page":"12501279","DOI":"10.1109\/TIT.2016.2518171","article-title":"An achievable rate region for the three-user interference channel based on coset codes","volume":"62","author":"Padakandla","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref195","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1998"},{"key":"2026032712175888900_ref196","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TIT.1983.1056723","article-title":"On the capacity of computer memory with defects","volume":"29","author":"Heegard","year":"1983","journal-title":"IEEE Trans. Information Theory"},{"issue":"5","key":"2026032712175888900_ref197","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1109\/TIT.2007.894693","article-title":"Carbon copying onto dirty paper","volume":"53","author":"Khisti","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref198","author":"Cohen","year":"2002"},{"issue":"9","key":"2026032712175888900_ref199","doi-asserted-by":"crossref","first-page":"5640","DOI":"10.1109\/TIT.2012.2202210","article-title":"Dirty-paper coding for the Gaussian multiaccess channel with conferencing","volume":"58","author":"Bross","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref200","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1147\/rd.24.0289","article-title":"Channels with side information at the transmitter","volume":"2","author":"Shannon","year":"1958","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"2026032712175888900_ref201","first-page":"52","article-title":"Coding in a memory with defective cells","volume":"10","author":"Kuznetsov","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"2026032712175888900_ref202","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00535682","article-title":"Bounds on conditional probabilities with applications in multi-user communication","volume":"34","author":"Ahlswede","year":"1976","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und verwandte Gebiete"},{"issue":"5","key":"2026032712175888900_ref203","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1109\/TIT.2005.846422","article-title":"On channels with partial channel state information at the transmitter","volume":"51","author":"Rosenzweig","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"2026032712175888900_ref204","doi-asserted-by":"crossref","first-page":"3992","DOI":"10.1109\/TIT.2005.856981","article-title":"The multiple-access channel with partial state information at the encoders","volume":"51","author":"Cemal","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref205","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1109\/TIT.2005.844108","article-title":"Channel capacity and state estimation for state-dependent Gaussian channels","volume":"51","author":"Sutivong","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref206","doi-asserted-by":"crossref","first-page":"37093719","DOI":"10.1109\/TIT.2013.2245719","article-title":"Causal state communication","volume":"59","author":"Choudhuri","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"2026032712175888900_ref207","doi-asserted-by":"crossref","first-page":"53965411","DOI":"10.1109\/TIT.2010.2068991","article-title":"Capacity of channels with action-dependent states","volume":"56","author":"Weissman","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref208","doi-asserted-by":"crossref","first-page":"24552477","DOI":"10.1109\/TIT.2009.2018346","article-title":"Capacity region of the finite-state multiple-access channel with and without feedback","volume":"55","author":"Permuter","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref209","volume-title":"Multiple access channels with state information known at some encoders","author":"Kotagiri","year":"2006"},{"issue":"12","key":"2026032712175888900_ref210","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1109\/TIT.2006.885466","article-title":"Capacity with causal and noncausal side information: A unified view","volume":"52","author":"Jafar","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref211","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TIT.2012.2216096","article-title":"The multiple-access channel with causal side information: Common state","volume":"59","author":"Lapidoth","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref212","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1109\/TIT.2012.2230214","article-title":"The multiple-access channel with causal side information: Double state","volume":"59","author":"Lapidoth","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"2026032712175888900_ref213","doi-asserted-by":"crossref","first-page":"7627","DOI":"10.1109\/TIT.2014.2365189","article-title":"Feedback, cribbing, and causal state information on the multiple-access channel","volume":"60","author":"Bracher","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref214","doi-asserted-by":"crossref","first-page":"5006","DOI":"10.1109\/TIT.2011.2158883","article-title":"Lattice strategies for the dirty multiple access channel","volume":"57","author":"Philosof","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref215","doi-asserted-by":"crossref","first-page":"6393","DOI":"10.1109\/TIT.2017.2726069","article-title":"An achievable rate region based on coset codes for multiple access channel with states","volume":"63","author":"Padakandla","year":"2017","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref216","doi-asserted-by":"crossref","first-page":"2012","DOI":"10.1109\/TIT.2002.1013140","article-title":"On the rate-distortion region for multiple descriptions","volume":"48","author":"Fu","year":"2002","journal-title":"IEEE. Trans. Inform. Theory"},{"key":"2026032712175888900_ref217","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1109\/18.556670","article-title":"Priority encoded transmission","volume":"42","author":"Albanese","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref218","doi-asserted-by":"crossref","DOI":"10.1109\/18.256491","article-title":"Design of multiple description scalar quantizers","volume":"39","author":"Vaishampayan","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"2026032712175888900_ref219","doi-asserted-by":"crossref","first-page":"5197","DOI":"10.1109\/TIT.2006.885498","article-title":"Multiple description quantization via Gram-Schmidt orthogonalization","volume":"52","author":"Chen","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref220","doi-asserted-by":"crossref","first-page":"3991","DOI":"10.1109\/TIT.2009.2025540","article-title":"Rate region of Gaussian multiple description coding with individual and central distortion constraints","volume":"55","author":"Chen","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref221","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1109\/TIT.1986.1057195","article-title":"On multiple descriptions and team guessing","volume":"32","author":"Ahlswede","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref222","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TIT.1985.1057102","article-title":"The rate-distortion region for multiple descriptions without excess rate","volume":"IT-31","author":"Ahlswede","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref223","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1002\/j.1538-7305.1980.tb03048.x","article-title":"BSTJ brief: On source networks with minimal breakdown degradation","volume":"59","author":"Witsenhausen","year":"1980","journal-title":"Bell Syst. Tech. J."},{"issue":"10","key":"2026032712175888900_ref224","doi-asserted-by":"crossref","first-page":"2281","DOI":"10.1002\/j.1538-7305.1981.tb00226.x","article-title":"Source coding for multiple descriptions ii: A binary source","volume":"60","author":"Witsenhausen","year":"1981","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"2026032712175888900_ref225","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/18.370136","article-title":"Multiple description source coding with no excess marginal rate","volume":"41","author":"Zhang","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref226","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1109\/TIT.2007.896880","article-title":"Vector Gaussian multiple description with individual and central receivers","volume":"53","author":"Wang","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref227","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/TIT.2008.2008146","article-title":"Vector Gaussian multiple description with two levels of receivers","volume":"55","author":"Wang","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref228","doi-asserted-by":"crossref","first-page":"4367","DOI":"10.1109\/TIT.2010.2054535","article-title":"Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions","volume":"56","author":"Mohajer","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref229","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/18.370142","article-title":"Multilevel diversity coding with distortion","volume":"41","author":"Yeung","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref230","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1109\/TIT.2011.2104650","article-title":"On the role of the refinement layer in multiple description coding and scalable coding","volume":"57","author":"Wang","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref231","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1109\/TIT.2003.815767","article-title":"Multiple description coding for many channels","author":"Venkataramani","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref232","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1109\/TIT.2005.844063","article-title":"N-channel symmetric multiple descriptions-Part II: An achievable rate-distortion region","volume":"51","author":"Puri","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref233","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1109\/TIT.2007.913435","article-title":"Multiuser successive refinement and multiple description coding","volume":"54","author":"Tian","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref234","doi-asserted-by":"crossref","first-page":"5344","DOI":"10.1109\/TIT.2010.2059651","volume":"56","author":"Tian","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref235","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TIT.2015.2506586","article-title":"Combinatorial message sharing and a new achievable region for multiple descriptions","volume":"62","author":"Viswanatha","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref236","first-page":"312316","volume-title":"in 2012 IEEE Information Theory Workshop","author":"Akyol","year":"2012"},{"issue":"5","key":"2026032712175888900_ref237","doi-asserted-by":"crossref","first-page":"37813809","DOI":"10.1109\/TIT.2018.2804439","article-title":"An achievable rate-distortion region for multiple descriptions source coding based on coset codes","volume":"64","author":"Shirani","year":"2018","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref238","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/TIT.2003.821998","volume":"50","author":"Pradhan","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1976","key":"2026032712175888900_ref239","article-title":"Cardinalities of finite distributive lattices","volume":"121","author":"Berman","year":"1976","journal-title":"Mitt. Math. Sem. Giessen"},{"key":"2026032712175888900_ref240","doi-asserted-by":"crossref","first-page":"2267","DOI":"10.1109\/TIT.2018.2798669","article-title":"Achievable rate region for three user discrete broadcast channel based on coset codes","volume":"64","author":"Padakandla","year":"2018","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref241","author":"Kang","year":"2008"},{"issue":"8","key":"2026032712175888900_ref242","first-page":"31253135","article-title":"The three-user finite-field multi-way relay channel with correlated sources","volume":"61","author":"Ong","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref243","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2020.2980550","article-title":"Structured mappings and conferencing common information for multiple-access channels","volume":"66","author":"Heidari","year":"2020","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref244","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1109\/18.508859","article-title":"Group block codes over nonabelian groups are asymptotically bad","volume":"42","author":"Interlando","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref245","doi-asserted-by":"crossref","DOI":"10.3934\/amc.2020058","article-title":"On the non-abelian group code capacity of memoryless channels","volume":"14","author":"Arpasi","year":"2020","journal-title":"Adv. Math. Commun."},{"key":"2026032712175888900_ref246","first-page":"817","volume-title":"Annales des t\u00e9l\u00e9communications","author":"Biglieri","year":"1995"},{"issue":"7","key":"2026032712175888900_ref247","doi-asserted-by":"crossref","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","article-title":"Some randomized code constructions from group actions","volume":"52","author":"Bazzi","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref248","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.2014.2368138","article-title":"Thresholds of random quasi-abelian codes","volume":"61","author":"Fan","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref249","first-page":"37","article-title":"Coding for noisy channels","volume":"4","author":"Elias","year":"1955","journal-title":"IRE Convention Record"},{"key":"2026032712175888900_ref250","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TIT.1955.1055131","article-title":"Error bounds in noisy channels without memory","volume":"1","author":"Feinstein","year":"1955","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref251","first-page":"283","article-title":"Asymptotic bounds of the probability of error for the transmission of messages over a discrete memoryless channel with a symmetric transition probability matrix","volume":"7","author":"Dobrushin","year":"1962","journal-title":"Teor. Veroyatnost. i Primenen"},{"key":"2026032712175888900_ref252","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0019-9958(67)90052-6","article-title":"Lower bounds on error probability for coding on discrete memoryless channels (Part I)","volume":"10","author":"Shannon","year":"1967","journal-title":"Inform. and Control"},{"key":"2026032712175888900_ref253","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0019-9958(67)91200-4","article-title":"Lower bounds on error probability for coding on discrete memoryless channels (Part II)","volume":"10","author":"Shannon","year":"1967","journal-title":"Inform. and Control"},{"issue":"1","key":"2026032712175888900_ref254","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TIT.1965.1053730","article-title":"A simple derivation of coding theorem and some applications","volume":"11","author":"Gallager","year":"1965","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref255","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/BF00531808","article-title":"Gedachtnisfreie kannale for diskrete zeit","volume":"6","author":"Augustin","year":"1966","journal-title":"Z. Wahrscheinlichkelts Theory Verw"},{"key":"2026032712175888900_ref256","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","article-title":"A perspective on multi-access channels","volume":"31","author":"Gallager","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref257","first-page":"23","article-title":"Lower bound for the error probability of multiple-access channels","volume":"11","author":"Haroutunian","year":"1975","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712175888900_ref258","volume-title":"Probabilistic Information Theory: Discrete and Memoryless Models","author":"Jelinek","year":"1968"},{"key":"2026032712175888900_ref259","first-page":"181","article-title":"On the error exponent for source coding and for testing simple statistical hypotheses","volume":"6","author":"Csisz\u00e1r","year":"1971","journal-title":"Studia Sci. Math. Hungar."},{"issue":"4","key":"2026032712175888900_ref260","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1109\/TIT.1974.1055254","article-title":"Hypothesis testing and information theory","volume":"20","author":"Blahut","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref261","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1974.1055204","article-title":"Error exponent for source coding with a fidelity criterion","volume":"20","author":"Marton","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref262","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/18.485710","article-title":"A new universal random coding bound for the multiple-access channels","volume":"42","author":"Liu","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref263","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/TIT.1985.1057104","article-title":"Random coding bounds and codes produced by permutations for the multiple-access channels","volume":"31","author":"Pokorney","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref264","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1109\/18.720546","article-title":"The method of types","volume":"44","author":"Csiszar","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref265","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TIT.1981.1056281","article-title":"Graph decomposition: A new key to coding theorems","volume":"27","author":"Csiszar","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref266","doi-asserted-by":"crossref","first-page":"3605","DOI":"10.1109\/TIT.2015.2424959","article-title":"Error exponent for multiple access channels: Upper bounds","volume":"61","author":"Nazari","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref267","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/18.978747","article-title":"Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding","volume":"48","author":"Weissman","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref268","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2002.806142","article-title":"Error exponents in scalable source coding","volume":"49","author":"Tuncel","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref269","doi-asserted-by":"crossref","first-page":"5615","DOI":"10.1109\/TIT.2011.2162178","article-title":"Improved source coding exponents via witsenhausen\u2019s rate","volume":"57","author":"Kelly","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"2026032712175888900_ref270","doi-asserted-by":"crossref","first-page":"5086","DOI":"10.1109\/TIT.2012.2201346","article-title":"Reliability in source coding with side information","volume":"58","author":"Kelly","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref271","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970241","volume-title":"Large Deviations and Applications","author":"Varadhan","year":"1984"},{"key":"2026032712175888900_ref272","volume-title":"Large Deviations Techniques and Applications","author":"Zeitouni","year":"1998"},{"key":"2026032712175888900_ref273","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.2016.2515720","article-title":"Distributed structure: Joint expurgation for the multiple-access channel","volume":"63","author":"Haim","year":"2017","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref274","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1215\/ijm\/1255380682","article-title":"The coding of messages subject to chance errors","volume":"1","author":"Wolfowitz","year":"1957","journal-title":"Illinois Journal of Mathematics"},{"issue":"3","key":"2026032712175888900_ref275","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1090\/qam\/113744","article-title":"On the strong converse of the coding theorem for symmetric channels without memory","volume":"18","author":"Weiss","year":"1960","journal-title":"Quart. Appl. Math."},{"key":"2026032712175888900_ref276","first-page":"1962","volume":"689-723","author":"Strassen","year":"1962","journal-title":"Czechoslovak Academy of Sciences, Prague, pp."},{"key":"2026032712175888900_ref277","author":"Baron","year":"2004"},{"issue":"11","key":"2026032712175888900_ref278","doi-asserted-by":"crossref","first-page":"4947","DOI":"10.1109\/TIT.2009.2030478","article-title":"Information spectrum approach to second-order coding rate in channel coding","volume":"55","author":"Hayashi","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref279","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","article-title":"Channel coding rate in the finite blocklength regime","volume":"56","author":"Polyanskiy","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref280","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TIT.2013.2291231","article-title":"On the dispersions of three network information theory problems","volume":"60","author":"Tan","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref281","doi-asserted-by":"crossref","first-page":"3309","DOI":"10.1109\/TIT.2012.2186786","article-title":"Fixed-length lossy compression in the finite blocklength regime","volume":"58","author":"Kostina","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref282","doi-asserted-by":"crossref","first-page":"2430","DOI":"10.1109\/TIT.2015.2411256","article-title":"The third-order term in the normal approximation for the AWGN channel","volume":"61","author":"Tan","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref283","volume-title":"Probability: Theory and Examples","author":"Durrett","year":"1991"},{"key":"2026032712175888900_ref284","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12066-8","volume-title":"Information-Spectrum Methods in Information Theory","author":"Han","year":"2003"},{"key":"2026032712175888900_ref285","volume-title":"Normal Approximation by Stein\u2019s Method","author":"Chen","year":"2010"},{"key":"2026032712175888900_ref286","first-page":"341","volume-title":"in 2006 IEEE International Symposium on Information Theory","author":"He","year":"2006"},{"issue":"12","key":"2026032712175888900_ref287","doi-asserted-by":"crossref","first-page":"5607","DOI":"10.1109\/TIT.2009.2032803","article-title":"On the redundancy of Slepian-Wolf coding","volume":"55","author":"He","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"2026032712175888900_ref288","doi-asserted-by":"crossref","first-page":"44174426","DOI":"10.1109\/TIT.2014.2323418","article-title":"Moderate deviations in channel coding","volume":"60","author":"Altu\u011f","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref289","first-page":"920","volume-title":"in 2012 IEEE International Symposium on Information Theory Proceedings","author":"Tan","year":"2012"},{"issue":"6","key":"2026032712175888900_ref290","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1002\/j.1538-7305.1968.tb00065.x","article-title":"The transmission distortion of a source as a function of the encoding block length","volume":"47","author":"Pilc","year":"1968","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"2026032712175888900_ref291","first-page":"48","article-title":"The relation between redundancy coding and the reliability of information from a source","volume":"4","author":"Krichevskii","year":"1968","journal-title":"Problemy Peredachi Informatsii"},{"issue":"6","key":"2026032712175888900_ref292","doi-asserted-by":"crossref","first-page":"1728","DOI":"10.1109\/18.340451","article-title":"Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding","volume":"40","author":"Linder","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref293","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/18.256490","article-title":"A rate of convergence result for a universal d-semifaithful code","volume":"39","author":"Yu","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref294","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/18.567651","article-title":"The redundancy of source coding with a fidelity criterion. I. known statistics","volume":"43","author":"Zhang","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref295","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/18.904517","article-title":"The redundancy of source coding with a fidelity criterion. II. coding at a fixed rate level with unknown statistics","volume":"47","author":"Yang","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref296","doi-asserted-by":"crossref","first-page":"3618","DOI":"10.1109\/TIT.2016.2549540","article-title":"Strong successive refinability and rate-distortion-complexity tradeoff","volume":"62","author":"No","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref297","first-page":"363","volume-title":"in 2012 IEEE International Symposium on Information Theory Proceedings","author":"Oguz","year":"2012"},{"key":"2026032712175888900_ref298","first-page":"3220","volume-title":"in 2017 IEEE International Symposium on Information Theory (ISIT)","author":"Moulin","year":"2017"},{"issue":"7","key":"2026032712175888900_ref299","doi-asserted-by":"crossref","first-page":"4104","DOI":"10.1109\/TIT.2020.2989177","article-title":"Communicating correlated sources over MAC and interference channels I: Separation-based schemes","volume":"66","author":"Padakandla","year":"2020","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref300","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1109\/FOCS.2016.65","volume-title":"in 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Ghazi","year":"2016"},{"issue":"1","key":"2026032712175888900_ref301","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.2019.2946364","article-title":"Communication for generating correlation: A unifying survey","volume":"66","author":"Sudan","year":"2019","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref302","doi-asserted-by":"crossref","first-page":"3419","DOI":"10.1109\/TIT.2016.2553672","article-title":"On non-interactive simulation of joint distributions","volume":"62","author":"Kamath","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref303","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/TIT.1981.1056323","article-title":"A note on the multiple access channel with correlated sources (corresp.)","volume":"27","author":"Dueck","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref304","author":"Shirani","year":"2019"},{"issue":"6","key":"2026032712175888900_ref305","doi-asserted-by":"crossref","first-page":"2714","DOI":"10.1109\/TIT.2010.2044058","article-title":"Sending a bivariate Gaussian over a Gaussian MAC","volume":"56","author":"Lapidoth","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref306","first-page":"429","volume-title":"in 2008 IEEE International Symposium on Information Theory","author":"Chen","year":"2008"},{"issue":"3","key":"2026032712175888900_ref307","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TIT.1977.1055710","article-title":"Two-user communication channels","volume":"23","author":"Sato","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref308","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/TIT.1978.1055883","article-title":"An outer bound on the capacity region of broadcast channel","volume":"24","author":"Sato","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref309","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/TIT.1983.1056697","article-title":"Outer bounds on the capacity of interference channels (corresp.)","volume":"29","author":"Carleial","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref310","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TIT.2006.887492","article-title":"An outer bound to the capacity region of the broadcast channel","volume":"53","author":"Nair","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref311","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/18.42175","article-title":"Dependence balance bounds for single-output two-way channels","volume":"35","author":"Hekstra","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref312","doi-asserted-by":"crossref","first-page":"4063","DOI":"10.1109\/TIT.2011.2145150","article-title":"Dependence balance based outer bounds for Gaussian networks with cooperation and feedback","volume":"57","author":"Tandon","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref313","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1109\/18.21243","article-title":"Partial converse for a relay channel","volume":"34","author":"Zhang","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref314","doi-asserted-by":"crossref","first-page":"2317","DOI":"10.1109\/TIT.2007.899484","article-title":"Generalized entropy power inequalities and monotonicity properties of information","volume":"53","author":"Madiman","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref315","doi-asserted-by":"crossref","first-page":"39363964","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 Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref316","doi-asserted-by":"crossref","first-page":"55335552","DOI":"10.1109\/TIT.2014.2333473","article-title":"Vector Gaussian multiterminal source coding","volume":"60","author":"Wang","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"10","key":"2026032712175888900_ref317","doi-asserted-by":"crossref","first-page":"4676","DOI":"10.1109\/TIT.2009.2027519","article-title":"Remote vector Gaussian source coding with decoder side information under mutual information and distortion constraints","volume":"55","author":"Tian","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref318","first-page":"187","article-title":"The strong converse to the coding theorem for the multiple-access channel","volume":"6","author":"Dueck","year":"1981","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"2026032712175888900_ref319","first-page":"4573","volume-title":"Diffusion, Quantum Theory, and Radically Elementary Mathematics","author":"Gross","year":"2014"},{"key":"2026032712175888900_ref320","author":"Anantharam","year":"2014"},{"issue":"2","key":"2026032712175888900_ref321","first-page":"101","article-title":"Probabilistic characteristics of graphs with large connectivity","volume":"10","author":"Margulis","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"issue":"3","key":"2026032712175888900_ref322","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TIT.1986.1057176","article-title":"A simple proof of the blowing-up lemma (corresp.)","volume":"32","author":"Marton","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref323","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TIT.2018.2876892","article-title":"the capacity of the relay channel\u2019: Solution to cover\u2019s problem in the Gaussian case","volume":"65","author":"Wu","year":"2019","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref324","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/proc\/201551001","article-title":"Transport inequalities and concentration of measure","volume":"51","author":"Gozlan","year":"2015","journal-title":"ESAIM: Proceedings and Surveys"},{"key":"2026032712175888900_ref325","author":"Marton"},{"key":"2026032712175888900_ref326","volume-title":"Concentration of Measure Inequalities in Information Theory, Communications, and Coding","author":"Raginsky","year":"2018","edition":"Third ed."},{"issue":"4","key":"2026032712175888900_ref327","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1109\/18.681320","article-title":"On characterization of entropy function via information inequalities","volume":"44","author":"Zhang","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref328","volume-title":"A First Course in Information Theory","author":"Yeung","year":"2012"},{"key":"2026032712175888900_ref329","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 Syst. Tech. J."},{"key":"2026032712175888900_ref330","first-page":"2004","author":"Weingarten","year":"2004,","journal-title":"CISS"},{"key":"2026032712175888900_ref331","volume-title":"Convex Bodies: The Brunn-Minkowski Theory","author":"Schneider","year":"2014"},{"issue":"2","key":"2026032712175888900_ref332","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":"Inform. Contr."},{"key":"2026032712175888900_ref333","first-page":"336","article-title":"Entropy and the central limit theorem","author":"Barron","year":"1986","journal-title":"Ann. Probab."},{"issue":"4","key":"2026032712175888900_ref334","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/TIT.2005.844072","article-title":"Mutual information and minimum mean-square error in Gaussian channels","volume":"51","author":"Guo","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref335","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-I","volume":"19","author":"Wyner","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref336","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-II","volume":"19","author":"Wyner","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref337","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TIT.1974.1055285","article-title":"Entropy inequalities for discrete channels","volume":"20","author":"Witsenhausen","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref338","doi-asserted-by":"crossref","first-page":"1428","DOI":"10.1109\/18.59938","article-title":"A binary analog to the entropypower inequality","volume":"36","author":"Shamai","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref339","author":"Jog"},{"issue":"3","key":"2026032712175888900_ref340","first-page":"64","article-title":"Markov processes over denumerable products of spaces describing large system of automata","volume":"5","author":"Vasershtein","year":"1969","journal-title":"Problemy Peredaci Informacii"},{"issue":"7","key":"2026032712175888900_ref341","first-page":"52","volume":"13","author":"Kantorovich","year":"1958","journal-title":"Petersburg University: Mathematics"},{"issue":"3","key":"2026032712175888900_ref342","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1137\/1115049","article-title":"Prescribing a system of random variables by conditional distributions","volume":"15","author":"Dobrushin","year":"1970","journal-title":"Theory Probab. Appl."},{"key":"2026032712175888900_ref343","first-page":"315","article-title":"A generalization of ornstein\u2019s d distance with applications to information theory","author":"Gray","year":"1975","journal-title":"Ann. Probab."},{"issue":"1-3","key":"2026032712175888900_ref344","doi-asserted-by":"crossref","DOI":"10.1007\/BF02773685","article-title":"The positive-divergence and blowing-up properties","volume":"86","author":"Marton","year":"1994","journal-title":"Israel J. Math."},{"issue":"1","key":"2026032712175888900_ref345","first-page":"73205","article-title":"Concentration of measure and isoperimetric inequalities in product spaces","volume":"81","author":"Talagrand","year":"1995","journal-title":"Publications Math\u00e9matiques de l\u2019Institut des Hautes Etudes Scientifiques"},{"issue":"3","key":"2026032712175888900_ref346","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1007\/BF02249263","article-title":"A measure concentration inequality for contracting markov chains","volume":"6","author":"Marton","year":"1996","journal-title":"Geometric & Functional Analysis GAFA"},{"key":"2026032712175888900_ref347","first-page":"927","article-title":"Information inequalities and concentration of measure","author":"Dembo","year":"1997","journal-title":"Ann. Probab."},{"issue":"2","key":"2026032712175888900_ref348","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/PL00008756","article-title":"In\u00e9galit\u00e9s de concentration pour les processus empiriques de classes de parties","volume":"119","author":"Rio","year":"2001","journal-title":"Probab. Theory Related Fields"},{"key":"2026032712175888900_ref349","volume-title":"The Concentration of Measure Phenomenon","author":"Ledoux","year":"2001"},{"key":"2026032712175888900_ref350","first-page":"27","volume":"8","author":"Cs\u00e1ki","year":"1963","journal-title":"Akad. Mat. Kutato Int. Kozl"},{"key":"2026032712175888900_ref351","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1214\/aop\/1176995937","article-title":"Spreading of sets in product spaces and hypercontraction of the Markov operator","volume":"4","author":"Ahlswede","year":"1976","journal-title":"Ann. Probab."},{"issue":"6","key":"2026032712175888900_ref352","doi-asserted-by":"crossref","first-page":"3419","DOI":"10.1109\/TIT.2016.2553672","article-title":"On non-interactive simulation of joint distributions","volume":"62","author":"Kamath","year":"2016","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref353","author":"Lapidoth","year":"2017"},{"key":"2026032712175888900_ref354","author":"Anantharam","year":"2019"},{"key":"2026032712175888900_ref355","author":"Nair","year":"2016"},{"key":"2026032712175888900_ref356","author":"Beigi","year":"2016"},{"key":"2026032712175888900_ref357","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/BF02249265","article-title":"Transportation cost for gaussian and other product measures","volume":"6","author":"Talagrand","year":"1996","journal-title":"Geometric and Functional Analysis GAFA"},{"key":"2026032712175888900_ref358","first-page":"2210","volume-title":"in 2020 IEEE International Symposium on Information Theory (ISIT)","author":"Bai","year":"2020"},{"issue":"6","key":"2026032712175888900_ref359","doi-asserted-by":"crossref","first-page":"1982","DOI":"10.1109\/18.641561","article-title":"A non-Shannon-type conditional inequality of information quantities","volume":"43","author":"Zhang","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref360","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1109\/TIT.2007.896862","article-title":"Networks, matroids, and non-shannon information inequalities","volume":"53","author":"Dougherty","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref361","doi-asserted-by":"crossref","DOI":"10.1109\/JPROC.2010.2095490","article-title":"Network coding and matroid theory","volume":"99","author":"Dougherty","year":"2011","journal-title":"Proceedings of the IEEE"},{"issue":"3","key":"2026032712175888900_ref362","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0963548399003740","article-title":"Conditional independences among four random variables iii: Final conclusion","volume":"8","author":"Mat\u00fas","year":"1999","journal-title":"Combin. Probab. Comput."},{"issue":"8","key":"2026032712175888900_ref363","doi-asserted-by":"crossref","first-page":"2745","DOI":"10.1109\/TIT.2005.851744","article-title":"Insufficiency of linear coding in network information flow","volume":"51","author":"Dougherty","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref364","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-018-03428-0","article-title":"Memory effects can make the transmission capability of a communication channel uncomputable","volume":"9","author":"Elkouss","year":"2018","journal-title":"Nat. Commun."},{"key":"2026032712175888900_ref365","author":"Boche","year":"2020"},{"key":"2026032712175888900_ref366","author":"Birk","year":". 1998"},{"key":"2026032712175888900_ref367","volume-title":"Communication over X channel: Signalling and multiplexing gain","author":"Maddah-Ali","year":". 2006"},{"key":"2026032712175888900_ref368","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1109\/TIT.2008.926460","article-title":"Communication over MIMO X channels: Interference alignment, decomposition, and performance analysis","volume":"54","author":"Maddah-Ali","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref369","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TIT.2007.911262","article-title":"Degrees of freedom region of the MIMO X channel","volume":"54","author":"Jafar","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref370","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MWC.2013.6472197","article-title":"The practical challenges of interference alignment","volume":"20","author":"Ayach","year":"2013","journal-title":"IEEE Wireless Communications"},{"issue":"7","key":"2026032712175888900_ref371","doi-asserted-by":"crossref","first-page":"3728","DOI":"10.1109\/TSP.2010.2046084","article-title":"From spectrum pooling to space pooling: Opportunistic interference alignment in MIMO cognitive networks","volume":"58","author":"Perlaza","year":"2010","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"2026032712175888900_ref372","doi-asserted-by":"crossref","first-page":"3309","DOI":"10.1109\/TIT.2011.2142270","article-title":"A distributed numerical approach to interference alignment and applications to wireless interference networks","volume":"57","author":"Gomadam","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref373","first-page":"2009","volume":"159-170","author":"Gollakota","year":"2009","journal-title":"Conference on Data Communication, pp."},{"key":"2026032712175888900_ref374","first-page":"2445","volume-title":"in 2009 IEEE International Conference on Acoustics, Speech and Signal Processing","author":"Peters","year":"2009"},{"issue":"9","key":"2026032712175888900_ref375","doi-asserted-by":"crossref","first-page":"5573","DOI":"10.1109\/TIT.2014.2338857","article-title":"Feasibility of interference alignment for the MIMO interference channel","volume":"60","author":"Bresler","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref376","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1109\/TIT.2011.2178588","article-title":"Interference alignment in regenerating codes for distributed storage: Necessity and code constructions","volume":"58","author":"Shah","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"15","key":"2026032712175888900_ref377","doi-asserted-by":"crossref","first-page":"3908","DOI":"10.1109\/TSP.2013.2264055","article-title":"Interference alignment under limited feedback for MIMO interference channels","volume":"61","author":"Krishnamachari","year":"2013","journal-title":"IEEE Trans. Signal Process."},{"issue":"9","key":"2026032712175888900_ref378","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/JSAC.2010.101202","article-title":"Multi-cell MIMO cooperative networks: A new look at interference","volume":"28","author":"Gesbert","year":"2010","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032712175888900_ref379","author":"Jafar"},{"issue":"3","key":"2026032712175888900_ref380","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TIT.2002.808134","article-title":"Information-theoretic analysis of information hiding","volume":"49","author":"Moulin","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref381","author":"Orlitsky","year":"1995"},{"issue":"9","key":"2026032712175888900_ref382","doi-asserted-by":"crossref","first-page":"6180","DOI":"10.1109\/TIT.2011.2161916","article-title":"Some results on distributed source coding for interactive function computation","volume":"57","author":"Ma","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref383","first-page":"596600","volume-title":"Proc. of the 2006 IEEE Inform. Theory Workshop (ITW \u201806)","author":"Tavildar","year":". 2006"},{"key":"2026032712175888900_ref384","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TIT.2002.808103","article-title":"Distributed source coding using syndromes (DISCUS): Design and construction","volume":"49","author":"Pradhan","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref385","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/TIT.2003.822581","article-title":"Geometric programming duals of channel capacity and rate-distortion","volume":"50","author":"Chiang","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref386","doi-asserted-by":"crossref","DOI":"10.1109\/ICASSP.1999.758336","volume-title":"An information-theoretic approach to the design of robust digital watermarking systems","author":"Chen","year":". 1999"},{"key":"2026032712175888900_ref387","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/TIT.1976.1055578","article-title":"Syndrome source-coding and its universal generalization","volume":"22","author":"Ancheta","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref388","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TIT.1978.1055868","article-title":"Bounds and techniques for linear source coding (Ph.D. Thesis abstract)","volume":"24","author":"Ancheta","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref389","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TIT.1975.1055470","article-title":"Convolutional source encoding","volume":"21","author":"Hellman","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref390","author":"Blizard","year":"1969"},{"key":"2026032712175888900_ref391","first-page":"60","article-title":"A comparison of data compression schemes using block codes","author":"Fung","year":"1973","journal-title":"Conf. Rec., IEEE Int. Electrical and Electronics Conf."},{"issue":"3","key":"2026032712175888900_ref392","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TIT.1973.1055006","article-title":"Direct sequential encoding and decoding for discrete sources","volume":"19","author":"Koshelev","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref393","doi-asserted-by":"crossref","first-page":"3082","DOI":"10.1109\/18.959290","article-title":"An algebraic construction of codes for SlepianWolf source networks","volume":"47","author":"Uyematsu","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref394","author":"Witsenhausen","year":". 1980"},{"issue":"4","key":"2026032712175888900_ref395","first-page":"555","article-title":"Near-shannon\/slepian-wolf performance for unknown correlated sources over awgn channels","volume":"53","author":"Garcia-Frias","year":"2005","journal-title":"IEEE Trans. Comput."},{"key":"2026032712175888900_ref396","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1109\/DCC.2002.999963","volume-title":"Proceedings DCC 2002. Data Compression Conference","author":"Aaron","year":"2002"},{"issue":"10","key":"2026032712175888900_ref397","doi-asserted-by":"crossref","DOI":"10.1109\/LCOMM.2002.804244","article-title":"Compression of binary sources with side information at the decoder using ldpc codes","volume":"6","author":"Liveris","year":"2002","journal-title":"IEEE Communications Letters"},{"issue":"5","key":"2026032712175888900_ref398","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/MSP.2004.1328091","article-title":"Distributed source coding for sensor networks","volume":"21","author":"Xiong","year":"2004","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026032712175888900_ref399","author":"Coleman","year":". 2004"},{"key":"2026032712175888900_ref400","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2004.1365064","volume-title":"Code design for lossless multiterminal networks","author":"Stankovic","year":". 2004"},{"key":"2026032712175888900_ref401","volume-title":"Proc. Conf. on Information Sciences and Systems (CISS)","author":"Zhao","year":". 2002"},{"key":"2026032712175888900_ref402","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/MSP.2004.1328091","article-title":"Distributed source coding for sensor networks","volume":"21","author":"Xiong","year":"2004","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026032712175888900_ref403","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TIT.2002.806145","article-title":"Lossless and near-lossless source coding for multiple access networks","volume":"49","author":"Zhao","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref404","author":"Rebollo-Monedero","year":". 2003"},{"key":"2026032712175888900_ref405","author":"Aaron","year":". 2002"},{"key":"2026032712175888900_ref406","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TIT.2002.806154","article-title":"On zeroerror source coding with decoder side information","volume":"49","author":"Koulgi","year":"2003","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref407","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/18.986048","article-title":"Multiple description vector quantization with a coarse lattice","volume":"IT-48","author":"Goyal","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref408","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/18.971747","article-title":"Asymmetric multiple description lattice vector quantizers","volume":"IT-48","author":"Diggavi","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref409","volume-title":"Multiple-description lattice vector quantization","author":"Ostergaard"},{"key":"2026032712175888900_ref410","author":"Sun","year":"2005"},{"issue":"10","key":"2026032712175888900_ref411","doi-asserted-by":"crossref","first-page":"3417","DOI":"10.1109\/TIT.2005.855586","article-title":"A close-to-capacity dirty paper coding scheme","volume":"51","author":"Erez","year":"2005","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"2026032712175888900_ref412","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/TIT.2006.872985","article-title":"Superposition coding for side-information channels","volume":"52","author":"Bennatan","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"2026032712175888900_ref413","doi-asserted-by":"crossref","first-page":"30513073","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"2026032712175888900_ref414","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","article-title":"Polar codes are optimal for lossy source coding","volume":"56","author":"Korada","year":"2010","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref415","first-page":"1488","volume-title":"in 2009 IEEE International Symposium on Information Theory","author":"Hussami","year":"2009"},{"key":"2026032712175888900_ref416","first-page":"918","volume-title":"in 2010 IEEE International Symposium on Information Theory","author":"Bakshi","year":"2010"},{"key":"2026032712175888900_ref417","first-page":"16","volume-title":"in 2011 IEEE International Symposium on Information Theory Proceedings","author":"Eslami","year":"2011"},{"key":"2026032712175888900_ref418","first-page":"188","volume-title":"in 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Eslami","year":"2010"},{"key":"2026032712175888900_ref419","first-page":"144","volume-title":"in 2009 IEEE Information Theory Workshop","author":"\u015ea\u015fo\u011flu","year":"2009"},{"key":"2026032712175888900_ref420","first-page":"1718","volume-title":"in 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Sahebi","year":"2011"},{"issue":"8","key":"2026032712175888900_ref421","doi-asserted-by":"crossref","first-page":"5437","DOI":"10.1109\/TIT.2012.2201374","volume":"58","author":"Abbe","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref422","author":"Park"},{"key":"2026032712175888900_ref423","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/Allerton.2012.6483270","volume-title":"in 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","author":"Sahebi","year":"2012"},{"key":"2026032712175888900_ref424","first-page":"909","volume-title":"in 2010 IEEE International Symposium on Information Theory","author":"Karzand","year":"2010"},{"issue":"10","key":"2026032712175888900_ref425","doi-asserted-by":"crossref","first-page":"6428","DOI":"10.1109\/TIT.2011.2162275","article-title":"Achieving the secrecy capacity of wiretap channels using polar codes","volume":"57","author":"Mahdavifar","year":"2011","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2026032712175888900_ref426","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TIT.2014.2368555","article-title":"Achieving marton\u2019s region for broadcast channels using polar codes","volume":"61","author":"Mondelli","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"2026032712175888900_ref427","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1109\/LCOMM.2010.08.100875","article-title":"Nested polar codes for wiretap and relay channels","volume":"14","author":"Andersson","year":"2010","journal-title":"IEEE Communications Letters"},{"issue":"2","key":"2026032712175888900_ref428","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2014.2378172","article-title":"Polar codes for broadcast channels","volume":"61","author":"Goela","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"2026032712175888900_ref429","doi-asserted-by":"crossref","DOI":"10.3934\/amc.2015.9.87","article-title":"Polar codes for distributed hierarchical source coding","volume":"9","author":"Ye","year":"2015","journal-title":"Adv. Math. Commun."},{"key":"2026032712175888900_ref430","doi-asserted-by":"crossref","first-page":"17181734","DOI":"10.1109\/18.930913","article-title":"Multiple description vector quantization with lattice codebooks: Design and analysis","volume":"47","author":"Vaishampayan","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref431","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/18.971747","article-title":"Asymmetric multiple description lattice vector quantizers","volume":"48","author":"Diggavi","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref432","first-page":"2491","article-title":"The analysis and design of windowed Fourier frame based multiple description source coding schemes","volume":"IT-46","author":"Balan","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref433","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1109\/TIT.2002.802643","article-title":"Index assignment for multichannel communication under failure","volume":"IT-48","author":"Berger-Wolf","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"2026032712175888900_ref434","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1109\/TIT.2004.833344","article-title":"Universal multiple description scalar quantization: Analysis and design","volume":"50","author":"Tian","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2026032712175888900_ref435","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/18.971748","article-title":"Dithered lattice-based quantizers for multiple descriptions","volume":"IT48","author":"Frank-Dayan","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2026032712175888900_ref436","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1109\/18.945243","article-title":"Generalized multiple description coding with correlating transforms","volume":"47","author":"Goyal","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"2026032712175888900_ref437","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/83.908500","article-title":"Multiple description coding using pairwise correlating transforms","volume":"10","author":"Wang","year":"2001","journal-title":"IEEE Transactions on Image Processing"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/18\/2\/173\/11153911\/0100000083en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/18\/2\/173\/11153911\/0100000083en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:38Z","timestamp":1777471838000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/18\/2\/173\/1332381\/An-Algebraic-and-Probabilistic-Framework-for"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":437,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1,1]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000083","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}