{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:33:41Z","timestamp":1780054421450,"version":"3.54.0"},"reference-count":291,"publisher":"Emerald","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,17]]},"abstract":"<jats:p>One-shot channel simulation (or channel synthesis) has seen increasing applications in lossy compression, differential privacy and machine learning. In this setting, an encoder observes a source X, and transmits a description to a decoder, so as to allow it to produce an output Y with a desired conditional distribution PY|X. In other words, the encoder and the decoder are simulating the noisy channel PY|X&amp;gt; using noiseless communication. This can also be seen as a lossy compression scheme with a stronger guarantee on the joint distribution of X and Y. This monograph gives an overview of the theory and applications of the channel simulation problem. We will present a unifying review of various one-shot and asymptotic channel simulation techniques that have been proposed in different areas, namely dithered quantization, rejection sampling, minimal random coding, likelihood encoder, soft covering, Poisson functional representation, and dyadic decomposition.<\/jats:p>","DOI":"10.1561\/0100000141","type":"journal-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T03:51:00Z","timestamp":1734407460000},"page":"847-1106","source":"Crossref","is-referenced-by-count":9,"title":["Channel Simulation: Theory and Applications to Lossy Compression and Differential Privacy"],"prefix":"10.1108","volume":"21","author":[{"given":"Cheuk Ting","family":"Li","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong Department of Information Engineering, , Hong Kong,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"2026032712073827300_ref001","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/2976749.2978318","article-title":"Deep learning with differential privacy","volume-title":"Proceedings of the 2016 ACM SIGSAC conference on computer and communications security","author":"Abadi","year":"2016"},{"key":"2026032712073827300_ref002","first-page":"12367","article-title":"Universally quantized neural compression","volume":"33","author":"Agustsson","year":"2020","journal-title":"Advances in neural information processing systems"},{"issue":"3","key":"2026032712073827300_ref003","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TIT.2011.2178136","article-title":"Source and channel simulation using arbitrary randomness","volume":"58","author":"Altu\u011f","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref004","first-page":"2","article-title":"Compressive differentially private federated learning through universal vector quantization","volume-title":"AAAI Workshop on Privacy-Preserving Artificial Intel ligence","author":"Amiri","year":"2021"},{"issue":"7","key":"2026032712073827300_ref005","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.sysconle.2007.03.010","article-title":"Common randomness and distributed control: A counterexample","volume":"56","author":"Anantharam","year":"2007","journal-title":"Systems & control letters"},{"key":"2026032712073827300_ref006","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1145\/2508859.2516735","article-title":"Geo-indistinguishability: Differential privacy for location-based systems","volume-title":"Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security","author":"Andr\u00e9s","year":"2013"},{"key":"2026032712073827300_ref007","volume-title":"Pairwise optimal coupling of multiple random variables","author":"Angel","year":"2019"},{"issue":"7","key":"2026032712073827300_ref008","doi-asserted-by":"crossref","first-page":"3051","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 Transactions on Information Theory"},{"key":"2026032712073827300_ref009","doi-asserted-by":"crossref","first-page":"2417","DOI":"10.1109\/ISIT45174.2021.9517918","article-title":"Synthesizing correlated randomness using algebraic structured codes","volume-title":"2021 IEEE International Symposium on Information Theory (ISIT)","author":"Atif","year":"2021"},{"issue":"1","key":"2026032712073827300_ref010","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TIT.2022.3196186","article-title":"Source coding for synthesizing correlated randomness","volume":"69","author":"Atif","year":"2022","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712073827300_ref011","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/JSTSP.2020.3034501","article-title":"Nonlinear transform coding","volume":"15","author":"Ball\u00e9","year":"2020","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"2026032712073827300_ref012","article-title":"End-to-end optimized image compression","volume-title":"5th International Conference on Learning Representations, ICLR 2017","author":"Ball\u00e9","year":"2017"},{"key":"2026032712073827300_ref013","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/NSW.2011.6004632","volume-title":"2011 IEEE Network Science Workshop","author":"Bao","year":"2011"},{"key":"2026032712073827300_ref014","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/1806689.1806701","article-title":"How to compress interactive communication","volume-title":"Proceedings of the forty-second ACM symposium on Theory of computing","author":"Barak","year":"2010"},{"issue":"35","key":"2026032712073827300_ref015","doi-asserted-by":"crossref","first-page":"6767","DOI":"10.1088\/0305-4470\/34\/35\/304","article-title":"On quantum coding for ensembles of mixed states","volume":"34","author":"Barnum","year":"2001","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"2026032712073827300_ref016","first-page":"25","volume-title":"Algorithmic Learning Theory","author":"Bassily","year":"2018"},{"key":"2026032712073827300_ref017","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/2746539.2746632","article-title":"Local, private, efficient protocols for succinct histograms","volume-title":"Proceedings of the forty-seventh annual ACM symposium on Theory of computing","author":"Bassily","year":"2015"},{"issue":"3","key":"2026032712073827300_ref018","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195","article-title":"On the Einstein Podolsky Rosen paradox","volume":"1","author":"Bell","year":"1964","journal-title":"Physics Physique Fizika"},{"issue":"5","key":"2026032712073827300_ref019","doi-asserted-by":"publisher","first-page":"2926","DOI":"10.1109\/TIT.2014.2309968","article-title":"The quantum reverse Shannon theorem and resource tradeoffs for simulating quantum channels","volume":"60","author":"Bennett","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"13","key":"2026032712073827300_ref020","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","article-title":"Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels","volume":"70","author":"Bennett","year":"1993","journal-title":"Physical review letters"},{"issue":"10","key":"2026032712073827300_ref021","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1109\/TIT.2002.802612","article-title":"Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem","volume":"48","author":"Bennett","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"issue":"20","key":"2026032712073827300_ref022","doi-asserted-by":"crossref","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","article-title":"Communication via one- and two-particle operators on einstein-podolsky-rosen states","volume":"69","author":"Bennett","year":"1992","journal-title":"Physical review letters"},{"key":"2026032712073827300_ref023","volume-title":"Rate Distortion Theory: A Mathematical Basis for Data Compression","author":"Berger","year":"1971"},{"key":"2026032712073827300_ref024","doi-asserted-by":"crossref","DOI":"10.1002\/0471219282.eot142","article-title":"Rate-distortion theory","volume-title":"Wiley Encyclopedia of Telecommunications","author":"Berger","year":"2003"},{"key":"2026032712073827300_ref025","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative matrices in the mathematical sciences","author":"Berman","year":"1994"},{"issue":"12","key":"2026032712073827300_ref026","doi-asserted-by":"crossref","first-page":"7987","DOI":"10.1109\/TIT.2014.2365207","article-title":"Identifying the information gain of a quantum measurement","volume":"60","author":"Berta","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref027","first-page":"6228","article-title":"The perception-distortion tradeoff","volume-title":"Proceedings of the IEEE conference on computer vision and pattern recognition","author":"Blau","year":"2018"},{"key":"2026032712073827300_ref028","first-page":"675","volume-title":"International Conference on Machine Learning","author":"Blau","year":"2019"},{"key":"2026032712073827300_ref029","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1109\/ISIT.2013.6620640","volume-title":"2013 IEEE International Symposium on Information Theory","author":"Bloch","year":"2013"},{"key":"2026032712073827300_ref030","first-page":"228","volume-title":"The Thirty Sixth Annual Conference on Learning Theory","author":"Block","year":"2023"},{"key":"2026032712073827300_ref031","article-title":"Scalable multi-party computation for zk-snark parameters in the random beacon model","volume-title":"Cryptology ePrint Archive","author":"Bowe","year":"2017"},{"issue":"9","key":"2026032712073827300_ref032","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1103\/PhysRevLett.83.1874","article-title":"Cost of exactly simulating quantum entanglement with classical communication","volume":"83","author":"Brassard","year":"1999","journal-title":"Physical Review Letters"},{"key":"2026032712073827300_ref033","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00037-016-0125-z","article-title":"Information-theoretic approximations of the nonnegative rank","volume":"26","author":"Braun","year":"2017","journal-title":"computational complexity"},{"key":"2026032712073827300_ref034","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-662-43948-7_42","volume-title":"International Col loquium on Automata, Languages, and Programming","author":"Braverman","year":"2014"},{"key":"2026032712073827300_ref035","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s00453-015-0112-9","article-title":"Towards a reverse Newman\u2019s theorem in interactive information complexity","volume":"76","author":"Brody","year":"2016","journal-title":"Algorithmica"},{"issue":"4","key":"2026032712073827300_ref036","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3344722","article-title":"Heavy hitters and the structure of local privacy","volume":"15","author":"Bun","year":"2019","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"2026032712073827300_ref037","volume-title":"Channel simulation: Finite blocklengths and broadcast channels","author":"Cao","year":"2022"},{"key":"2026032712073827300_ref038","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/ISIT50566.2022.9834411","volume-title":"2022 IEEE International Symposium on Information Theory (ISIT)","author":"Cao","year":"2022"},{"key":"2026032712073827300_ref039","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1109\/ISIT54713.2023.10206649","article-title":"Broadcast channel simulation","volume-title":"2023 IEEE International Symposium on Information Theory (ISIT)","author":"Cao","year":"2023"},{"issue":"11","key":"2026032712073827300_ref040","doi-asserted-by":"crossref","first-page":"2521","DOI":"10.1103\/PhysRevLett.84.2521","article-title":"Classical teleportation of a quantum bit","volume":"84","author":"Cerf","year":"2000","journal-title":"Physical Review Letters"},{"issue":"8","key":"2026032712073827300_ref041","doi-asserted-by":"crossref","first-page":"4681","DOI":"10.1109\/TIT.2020.2984345","article-title":"Strong coordination of signals and actions over noisy channels with two-sided state information","volume":"66","author":"Cervia","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref042","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/SFCS.2001.959901","volume-title":"Proceedings 42nd IEEE Symposium on Foundations of Computer Science","author":"Chakrabarti","year":"2001"},{"issue":"2","key":"2026032712073827300_ref043","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1214\/17-AAP1326","article-title":"The sample size required in importance sampling","volume":"28","author":"Chatterjee","year":"2018","journal-title":"The Annals of Applied Probability"},{"key":"2026032712073827300_ref044","doi-asserted-by":"crossref","DOI":"10.1109\/JSAIT.2022.3231820","article-title":"On the rate-distortion-perception function","volume-title":"IEEE Journal on Selected Areas in Information Theory","author":"Chen","year":"2022"},{"key":"2026032712073827300_ref045","volume-title":"2021 IEEE Information Theory Workshop (ITW)","author":"Choi","year":"2021"},{"key":"2026032712073827300_ref046","first-page":"3146","article-title":"Variable rate deep image compression with a conditional autoencoder","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","author":"Choi","year":"2019"},{"issue":"4","key":"2026032712073827300_ref047","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1109\/JSTSP.2020.2975903","article-title":"Universal deep neural network compression","volume":"14","author":"Choi","year":"2020","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"2026032712073827300_ref048","first-page":"1138","volume-title":"2016 IEEE ISIT","author":"Cicalese","year":"2016"},{"issue":"6","key":"2026032712073827300_ref049","doi-asserted-by":"crossref","first-page":"3436","DOI":"10.1109\/TIT.2019.2894519","article-title":"Minimum-entropy couplings and their applications","volume":"65","author":"Cicalese","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712073827300_ref050","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/18.992785","article-title":"Supermodularity and subadditivity properties of the entropy on the majorization lattice","volume":"48","author":"Cicalese","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref051","article-title":"On the use of financial data as a random beacon","volume-title":"2010 Electronic Voting Technology Work-shop\/Workshop on Trustworthy Elections (EVT\/WOTE 10)","author":"Clark","year":"2010"},{"key":"2026032712073827300_ref052","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0024-3795(93)90224-C","article-title":"Nonnegative ranks, decompositions, and factorizations of nonnegative matrices","volume":"190","author":"Cohen","year":"1993","journal-title":"Linear Algebra and its Applications"},{"key":"2026032712073827300_ref053","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/ISIT50566.2022.9834675","volume-title":"2022 IEEE International Symposium on Information Theory (ISIT)","author":"Compton","year":"2022"},{"key":"2026032712073827300_ref054","first-page":"10 445","volume-title":"International Conference on Artificial Intel ligence and Statistics","author":"Compton","year":"2023"},{"key":"2026032712073827300_ref055","volume-title":"Sphere Packings, Lattices and Groups","author":"Conway","year":"2013"},{"key":"2026032712073827300_ref056","volume-title":"Elements of information theory","author":"Cover","year":"1999"},{"key":"2026032712073827300_ref057","doi-asserted-by":"crossref","first-page":"2701","DOI":"10.1109\/ISIT.2007.4557184","volume-title":"2007 IEEE International Symposium on Information Theory","author":"Cover","year":"2007"},{"key":"2026032712073827300_ref058","volume-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","author":"Cover","year":"2006"},{"issue":"1","key":"2026032712073827300_ref059","doi-asserted-by":"crossref","first-page":"014 302","DOI":"10.1103\/PhysRevA.66.014302","article-title":"Cost of exactly simulating a bell pair using classical communication","volume":"66","author":"Csirik","year":"2002","journal-title":"Physical Review A"},{"issue":"6","key":"2026032712073827300_ref060","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1109\/18.720546","article-title":"The method of types","volume":"44","author":"Csisz\u00e1r","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref061","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"2011"},{"issue":"8","key":"2026032712073827300_ref062","doi-asserted-by":"crossref","first-page":"5509","DOI":"10.1109\/TIT.2011.2159047","article-title":"Zero-error channel capacity and simulation assisted by non-local correlations","volume":"57","author":"Cubitt","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref063","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/ISIT.2008.4595216","volume-title":"2008 IEEE International Symposium on Information Theory","author":"Cuff","year":"2008"},{"issue":"11","key":"2026032712073827300_ref064","doi-asserted-by":"crossref","first-page":"7071","DOI":"10.1109\/TIT.2013.2279330","article-title":"Distributed channel synthesis","volume":"59","author":"Cuff","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref065","doi-asserted-by":"crossref","first-page":"2963","DOI":"10.1109\/ISIT.2016.7541842","volume-title":"2016 IEEE International Symposium on Information Theory (ISIT)","author":"Cuff","year":"2016"},{"issue":"9","key":"2026032712073827300_ref066","doi-asserted-by":"crossref","first-page":"4181","DOI":"10.1109\/TIT.2010.2054651","article-title":"Coordination capacity","volume":"56","author":"Cuff","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref067","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-Uniform Random Variate Generation","author":"Devroye","year":"1986"},{"key":"2026032712073827300_ref068","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/FOCS.2013.53","volume-title":"2013 IEEE 54th annual symposium on foundations of computer science","author":"Duchi","year":"2013"},{"key":"2026032712073827300_ref069","article-title":"COIN++: Neural compression across modalities","volume-title":"Transactions on Machine Learning Research","author":"Dupont","year":"2022"},{"key":"2026032712073827300_ref070","article-title":"COIN: COmpression with Implicit Neural representations","volume-title":"Neural Compression: From Information Theory to Applications\u2013Workshop@ ICLR 2021","author":"Dupont","year":"2021"},{"key":"2026032712073827300_ref071","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of cryptography conference","author":"Dwork","year":"2006"},{"issue":"3","key":"2026032712073827300_ref072","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork","year":"2014","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"},{"key":"2026032712073827300_ref073","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"El Gamal","year":"2011"},{"issue":"3","key":"2026032712073827300_ref074","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1214\/aoms\/1177692552","article-title":"The efficient construction of an unbiased random sequence","volume":"43","author":"Elias","year":"1972","journal-title":"The Annals of Mathematical Statistics"},{"issue":"2","key":"2026032712073827300_ref075","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representations of the integers","volume":"21","author":"Elias","year":"1975","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref076","doi-asserted-by":"crossref","DOI":"10.1109\/JSAC.2023.3288243","article-title":"Generative joint source-channel coding for semantic image transmission","volume-title":"IEEE Journal on Selected Areas in Communications","author":"Erdemir","year":"2023"},{"key":"2026032712073827300_ref077","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/773153.773174","article-title":"Limiting privacy breaches in privacy preserving data mining","volume-title":"Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","author":"Evfimievski","year":"2003"},{"key":"2026032712073827300_ref078","volume-title":"The transmission of information","author":"Fano","year":"1949"},{"key":"2026032712073827300_ref079","doi-asserted-by":"crossref","DOI":"10.1063\/1.3057290","volume-title":"Transmission of Information","author":"Fano","year":"1961"},{"key":"2026032712073827300_ref080","first-page":"3208","volume-title":"International Conference on Machine Learning","author":"Feldman","year":"2021"},{"key":"2026032712073827300_ref081","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187530","article-title":"New loophole for the einstein-podolsky-rosen paradox","volume":"8","author":"Feldmann","year":"1995","journal-title":"Foundations of Physics Letters"},{"key":"2026032712073827300_ref082","article-title":"Greedy Poisson rejection sampling","volume-title":"Advances in Neural Information Processing Systems","author":"Flamich","year":"2024"},{"key":"2026032712073827300_ref083","first-page":"16 131","article-title":"Compressing images by encoding their latent representations with relative entropy coding","volume":"33","author":"Flamich","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026032712073827300_ref084","first-page":"6548","volume-title":"International Conference on Machine Learning","author":"Flamich","year":"2022"},{"key":"2026032712073827300_ref085","article-title":"Faster relative entropy coding with greedy rejection coding","volume-title":"Advances in Neural Information Processing Systems","author":"Flamich","year":"2024"},{"key":"2026032712073827300_ref086","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/ISIT54713.2023.10206725","volume-title":"2023 IEEE International Symposium on Information Theory (ISIT)","author":"Flamich","year":"2023"},{"key":"2026032712073827300_ref087","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT-W61686.2024.10591765","volume-title":"Some notes on the sample complexity of approximate channel simulation","author":"Flamich","year":"2024"},{"issue":"1","key":"2026032712073827300_ref088","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0166-218X(93)00116-H","article-title":"Robust universal complete codes for transmission and compression","volume":"64","author":"Fraenkel","year":"1996","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2026032712073827300_ref089","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00220-015-2463-0","article-title":"Classical information storage in an n-level quantum system","volume":"340","author":"Frenkel","year":"2015","journal-title":"Communications in Mathematical Physics"},{"issue":"5","key":"2026032712073827300_ref090","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TIT.1968.1054193","article-title":"Asymptotically efficient quantizing","volume":"14","author":"Gish","year":"1968","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref091","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1109\/ISIT57864.2024.10619339","article-title":"On channel simulation with causal rejection samplers","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Goc","year":"2024"},{"key":"2026032712073827300_ref092","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/ITW.2012.6404703","volume-title":"2012 IEEE Information Theory Workshop","author":"Gohari","year":"2012"},{"key":"2026032712073827300_ref093","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/ITW.2011.6089587","volume-title":"2011 IEEE Information Theory Workshop","author":"Gohari","year":"2011"},{"issue":"6","key":"2026032712073827300_ref094","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1111\/j.1468-0262.2006.00720.x","article-title":"Optimal use of communication resources","volume":"74","author":"Gossner","year":"2006","journal-title":"Econometrica"},{"issue":"3","key":"2026032712073827300_ref095","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/18.256489","article-title":"Dithered quantizers","volume":"39","author":"Gray","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712073827300_ref096","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1109\/18.720541","article-title":"Quantization","volume":"44","author":"Gray","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712073827300_ref097","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/JSAC.2022.3223408","article-title":"Beyond transmitting bits: Context, semantics, and task-oriented communications","volume":"41","author":"G\u00fcnd\u00fcz","year":"2022","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032712073827300_ref098","first-page":"1938","article-title":"Compression with Bayesian implicit neural representations","volume":"36","author":"Guo","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"5","key":"2026032712073827300_ref099","first-page":"2659","article-title":"Simulation of a channel with another channel","volume":"63","author":"Haddadpour","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712073827300_ref100","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/TIT.1979.1055989","article-title":"Evaluation of an achievable rate region for the broadcast channel","volume":"25","author":"Hajek","year":"1979","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref101","volume-title":"The rate-distortion-perception trade-off: The role of private randomness","author":"Hamdi","year":"2024"},{"issue":"3","key":"2026032712073827300_ref102","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1109\/18.256486","article-title":"Approximation theory of output statistics","volume":"39","author":"Han","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712073827300_ref103","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.556116","article-title":"Interval algorithm for random number generation","volume":"43","author":"Han","year":"1997","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref104","first-page":"290","volume-title":"International Conference on Sequences and Their Applications","author":"Haramoto","year":"2008"},{"issue":"3","key":"2026032712073827300_ref105","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1287\/ijoc.1070.0251","article-title":"Efficient jump ahead for F2-linear random number generators","volume":"20","author":"Haramoto","year":"2008","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"2026032712073827300_ref106","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TIT.2009.2034824","article-title":"The communication complexity of correlation","volume":"56","author":"Harsha","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref107","first-page":"7575","volume-title":"ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Has\u0131rc\u0131o\u011flu","year":"2024"},{"key":"2026032712073827300_ref108","article-title":"Minimal random code learning: Getting bits back from compressed model parameters","volume-title":"7th International Conference on Learning Representations, ICLR 2019","author":"Havasi","year":"2019"},{"issue":"4","key":"2026032712073827300_ref109","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1109\/TIT.2006.871040","article-title":"General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel","volume":"52","author":"Hayashi","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712073827300_ref110","doi-asserted-by":"crossref","first-page":"4619","DOI":"10.1109\/TIT.2008.928985","article-title":"Second-order asymptotics in fixed-length source coding and intrinsic randomness","volume":"54","author":"Hayashi","year":"2008","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712073827300_ref111","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 Transactions on Information Theory"},{"key":"2026032712073827300_ref112","article-title":"Recombiner: Robust and enhanced compression with bayesian implicit neural representations","volume-title":"The Twelfth International Conference on Learning Representations","author":"He","year":"2024"},{"key":"2026032712073827300_ref113","volume-title":"Accelerating relative entropy coding with space partitioning","author":"He","year":"2024"},{"key":"2026032712073827300_ref114","first-page":"613","article-title":"Compression with exact error distribution for federated learning","volume":"238","author":"Hegazy","year":"2024","journal-title":"Proceedings of The 27th International Conference on Artificial Intel ligence and Statistics"},{"key":"2026032712073827300_ref115","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/ITW54588.2022.9965925","volume-title":"2022 IEEE Information Theory Workshop (ITW)","author":"Hegazy","year":"2022"},{"key":"2026032712073827300_ref116","first-page":"501","volume-title":"The Col lected Works of Wassily Hoeffding","author":"Hoeffding","year":"1970"},{"issue":"3","key":"2026032712073827300_ref117","first-page":"3","article-title":"Bounds for the quantity of information transmitted by a quantum communication channel","volume":"9","author":"Holevo","year":"1973","journal-title":"Problemy Peredachi Informatsii"},{"issue":"9","key":"2026032712073827300_ref118","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimumredundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proceedings of the IRE"},{"issue":"2","key":"2026032712073827300_ref119","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1109\/TPAMI.2022.3157042","article-title":"A review of the gumbel-max trick and its extensions for discrete stochasticity in machine learning","volume":"45","author":"Huijben","year":"2022","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intel ligence"},{"key":"2026032712073827300_ref120","first-page":"487","volume-title":"Proceedings of The 27th International Conference on Artificial Intel ligence and Statistics","author":"Isik","year":"2024"},{"key":"2026032712073827300_ref121","doi-asserted-by":"crossref","DOI":"10.1017\/9781139171809","volume-title":"An Introduction to Probability Theory","author":"It\u00f4","year":"1984"},{"key":"2026032712073827300_ref122","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45061-0_26","volume-title":"Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30\u2013July 4, 2003 Proceedings 30","author":"Jain","year":"2003"},{"issue":"8","key":"2026032712073827300_ref123","doi-asserted-by":"crossref","first-page":"5171","DOI":"10.1109\/TIT.2013.2258372","article-title":"Efficient protocols for generating bipartite classical distributions and quantum states","volume":"59","author":"Jain","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712073827300_ref124","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1002\/j.1538-7305.1972.tb02653.x","article-title":"The application of dither to the quantization of speech signals","volume":"51","author":"Jayant","year":"1972","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"2026032712073827300_ref125","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/TCOM.1967.1089532","article-title":"The divergence and Bhattacharyya distance measures in signal selection","volume":"15","author":"Kailath","year":"1967","journal-title":"IEEE transactions on communication technology"},{"issue":"1","key":"2026032712073827300_ref126","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000083","article-title":"Advances and open problems in federated learning","volume":"14","author":"Kairouz","year":"2021","journal-title":"Foundations and trends\u00ae in machine learning"},{"key":"2026032712073827300_ref127","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4015-8","volume-title":"Foundations of Modern Probability","author":"Kallenberg","year":"2002"},{"issue":"3","key":"2026032712073827300_ref128","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/090756090","article-title":"What can we learn privately?","volume":"40","author":"Kasiviswanathan","year":"2011","journal-title":"SIAM Journal on Computing"},{"key":"2026032712073827300_ref129","first-page":"101","volume-title":"Indagationes Mathematicae (Proceedings)","author":"Kemperman","year":"1974"},{"key":"2026032712073827300_ref130","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1109\/ISIT57864.2024.10619580","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Khisti","year":"2024"},{"key":"2026032712073827300_ref131","volume-title":"Auto-encoding variational Bayes","author":"Kingma","year":"2013"},{"issue":"12","key":"2026032712073827300_ref132","first-page":"811","article-title":"Results on lattice vector quantization with dithering","volume":"43","author":"Kirac","year":"1996","journal-title":"IEEE Transactions On Circuits and Systems II: Analog and Digital Signal Processing"},{"key":"2026032712073827300_ref133","first-page":"1","article-title":"Bayesian estimates of equation system parameters: An application of integration by monte carlo","volume-title":"Econometrica: Journal of the Econometric Society","author":"Kloek","year":"1978"},{"key":"2026032712073827300_ref134","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-77697-2","volume-title":"Random numbers and computers","author":"Kneusel","year":"2018"},{"key":"2026032712073827300_ref135","first-page":"357","article-title":"The complexity of nonuniform random number generation","volume-title":"Algorithms and Complexity: New Directions and Recent Results","author":"Knuth","year":"1976"},{"key":"2026032712073827300_ref136","doi-asserted-by":"crossref","first-page":"1907","DOI":"10.1109\/ISIT57864.2024.10619428","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Kobus","year":"2024"},{"key":"2026032712073827300_ref137","article-title":"Universal sample coding","volume-title":"The Thirty-eighth Annual Conference on Neural Information Processing Systems","author":"Kobus","year":"2024"},{"key":"2026032712073827300_ref138","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v31i1.10674","article-title":"Entropic causal inference","volume-title":"Thirty-First AAAI Conference on Artificial Intel ligence","author":"Kocaoglu","year":"2017"},{"key":"2026032712073827300_ref139","first-page":"1465","volume-title":"2017 IEEE ISIT","author":"Kocaoglu","year":"2017"},{"key":"2026032712073827300_ref140","first-page":"385","article-title":"On certain asymptotic characteristics of completely bounded metric spaces","volume":"108","author":"Kolmogorov","year":"1956","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2026032712073827300_ref141","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ic.2015.04.003","article-title":"On the entropy of couplings","volume":"242","author":"Kova\u010devi\u0107","year":"2015","journal-title":"Information and Computation"},{"key":"2026032712073827300_ref142","volume-title":"A device for quantizing, grouping, and coding amplitude-modulated pulses","author":"Kraft","year":"1949"},{"issue":"2","key":"2026032712073827300_ref143","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TIT.2006.889015","article-title":"Communicating probability distributions","volume":"53","author":"Kramer","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref144","first-page":"161","article-title":"Exact common information","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Kumar","year":"2014"},{"issue":"8","key":"2026032712073827300_ref145","doi-asserted-by":"crossref","first-page":"4948","DOI":"10.1109\/TIT.2021.3091604","article-title":"Coordination through shared randomness","volume":"67","author":"Kurri","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712073827300_ref146","doi-asserted-by":"crossref","first-page":"7575","DOI":"10.1109\/TIT.2022.3184643","article-title":"Multiple access channel simulation","volume":"68","author":"Kurri","year":"2022","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref147","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TSP.2023.3244092","article-title":"Joint privacy enhancement and quantization in federated learning","volume":"71","author":"Lang","year":"2023","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026032712073827300_ref148","doi-asserted-by":"crossref","DOI":"10.1017\/9781316104477","volume-title":"Lectures on the Poisson Process","author":"Last","year":"2017"},{"key":"2026032712073827300_ref149","first-page":"30","volume-title":"International Zurich Seminar on Information and Communication (IZS 2018). Proceedings","author":"Le Treust","year":"2018"},{"issue":"6755","key":"2026032712073827300_ref150","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"Lee","year":"1999","journal-title":"Nature"},{"key":"2026032712073827300_ref151","first-page":"1277","volume-title":"2015 IEEE ISIT","author":"Lee","year":"2015"},{"issue":"10","key":"2026032712073827300_ref152","doi-asserted-by":"crossref","first-page":"6779","DOI":"10.1109\/TIT.2018.2864731","article-title":"A unified random coding bound","volume":"64","author":"Lee","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712073827300_ref153","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1109\/JSAIT.2023.3273467","article-title":"Neural estimation of the rate-distortion function with applications to operational source coding","volume":"3","author":"Lei","year":"2022","journal-title":"IEEE Journal on Selected Areas in Information Theory"},{"issue":"4","key":"2026032712073827300_ref154","doi-asserted-by":"publisher","first-page":"2583","DOI":"10.1109\/TIT.2018.2803752","article-title":"A universal coding scheme for remote generation of continuous random variables","volume":"64","author":"Li","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712073827300_ref155","doi-asserted-by":"publisher","first-page":"6967","DOI":"10.1109\/TIT.2018.2865570","article-title":"Strong functional representation lemma and applications to coding theorems","volume":"64","author":"Li","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref156","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/ISIT.2018.8437318","article-title":"Minimax learning for remote prediction","volume-title":"2018 IEEE ISIT","author":"Li","year":"2018"},{"key":"2026032712073827300_ref157","volume-title":"PSITIP - Python symbolic information theoretic inequality prover","author":"Li","year":"2020"},{"issue":"8","key":"2026032712073827300_ref158","doi-asserted-by":"publisher","first-page":"5259","DOI":"10.1109\/TIT.2021.3076986","article-title":"Efficient approximate minimum entropy coupling of multiple probability distributions","volume":"67","author":"Li","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712073827300_ref159","doi-asserted-by":"publisher","first-page":"6857","DOI":"10.1109\/TIT.2023.3296597","article-title":"An automated theorem proving framework for information-theoretic results","volume":"69","author":"Li","year":"2023","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref160","first-page":"28","volume-title":"Pointwise redundancy in one-shot lossy compression via Poisson functional representation","author":"Li","year":"2024"},{"key":"2026032712073827300_ref161","volume-title":"Pairwise multi-marginal optimal transport and embedding for earth mover\u2019s distance","author":"Li","year":"2019"},{"issue":"5","key":"2026032712073827300_ref162","doi-asserted-by":"crossref","first-page":"2624","DOI":"10.1109\/TIT.2021.3058842","article-title":"A unified framework for one-shot achievability via the Poisson matching lemma","volume":"67","author":"Li","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712073827300_ref163","doi-asserted-by":"crossref","first-page":"6329","DOI":"10.1109\/TIT.2017.2735438","article-title":"Distributed simulation of continuous random variables","volume":"63","author":"Li","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"2026032712073827300_ref164","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/LSP.2010.2087749","article-title":"Distribution preserving quantization with dithering and transformation","volume":"17","author":"Li","year":"2010","journal-title":"IEEE Signal Processing Letters"},{"key":"2026032712073827300_ref165","volume-title":"On distribution preserving quantization","author":"Li","year":"2011"},{"key":"2026032712073827300_ref166","volume-title":"Lectures on the coupling method","author":"Lindvall","year":"2002"},{"key":"2026032712073827300_ref167","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1109\/ISIT54713.2023.10206836","volume-title":"2023 IEEE International Symposium on Information Theory (ISIT)","author":"Ling","year":"2023"},{"key":"2026032712073827300_ref168","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1109\/ISIT57864.2024.10619181","article-title":"Rejection-sampled universal quantization for smaller quantization errors","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Ling","year":"2024"},{"key":"2026032712073827300_ref169","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1109\/ISIT.2018.8437857","article-title":"Rejection sampling and noncausal sampling under moment constraints","volume-title":"2018 IEEE ISIT","author":"Liu","year":"2018"},{"issue":"12","key":"2026032712073827300_ref170","doi-asserted-by":"crossref","first-page":"8067","DOI":"10.1109\/TIT.2019.2919720","article-title":"Sharp bounds for mutual covering","volume":"65","author":"Liu","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref171","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-76371-2","volume-title":"Monte Carlo Strategies in Scientific Computing","author":"Liu","year":"2004"},{"key":"2026032712073827300_ref172","first-page":"836","volume-title":"2010 48th Annual Al lerton Conference on Communication, Control, and Computing (Al lerton)","author":"Liu","year":"2010"},{"key":"2026032712073827300_ref173","article-title":"Universal exact compression of differentially private mechanisms","volume-title":"Thirty-Eighth Annual Conference on Neural Information Processing Systems (NeurIPS 2024)","author":"Liu","year":"2024"},{"key":"2026032712073827300_ref174","doi-asserted-by":"crossref","first-page":"3124","DOI":"10.1109\/ISIT57864.2024.10619467","article-title":"One-shot coding over general noisy networks","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Liu","year":"2024"},{"issue":"9","key":"2026032712073827300_ref175","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 Transactions on Information Theory"},{"key":"2026032712073827300_ref176","volume-title":"Information theory, inference and learning algorithms","author":"MacKay","year":"2003"},{"key":"2026032712073827300_ref177","doi-asserted-by":"crossref","first-page":"193","DOI":"10.7551\/mitpress\/10761.003.0008","article-title":"A Poisson process model for Monte Carlo","volume-title":"Perturbation, Optimization, and Statistics","author":"Maddison","year":"2016"},{"key":"2026032712073827300_ref178","article-title":"A* sampling","volume-title":"Advances in neural information processing systems","author":"Maddison","year":"2014"},{"key":"2026032712073827300_ref179","doi-asserted-by":"publisher","first-page":"1919","DOI":"10.1109\/ISIT57864.2024.10619094","article-title":"Broadcast channel synthesis from shared randomness","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Managoli","year":"2024"},{"key":"2026032712073827300_ref180","volume-title":"Inequalities: theory of Majorization and its Applications","author":"Marshall","year":"2011"},{"issue":"5","key":"2026032712073827300_ref181","doi-asserted-by":"crossref","first-page":"052 305","DOI":"10.1103\/PhysRevA.63.052305","article-title":"Classical simulation of quantum entanglement without local hidden variables","volume":"63","author":"Massar","year":"2001","journal-title":"Physical Review A"},{"issue":"11","key":"2026032712073827300_ref182","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1587\/comex.2018XBL0109","article-title":"Introducing the perception-distortion tradeoff into the rate-distortion theory of general information sources","volume":"7","author":"Matsumoto","year":"2018","journal-title":"IEICE Communications Express"},{"issue":"2","key":"2026032712073827300_ref183","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1587\/comex.2018XBL0139","article-title":"Rate-distortion-perception tradeoff of variablelength source coding for general information sources","volume":"8","author":"Matsumoto","year":"2019","journal-title":"IEICE Communications Express"},{"key":"2026032712073827300_ref184","first-page":"404","volume-title":"PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association","author":"Maudlin","year":"1992"},{"key":"2026032712073827300_ref185","first-page":"1273","volume-title":"Artificial intel ligence and statistics","author":"McMahan","year":"2017"},{"key":"2026032712073827300_ref186","article-title":"Learning differentially private recurrent language models","volume-title":"International Conference on Learning Representations","author":"McMahan","year":"2018"},{"key":"2026032712073827300_ref187","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/2811587.2811619","article-title":"5G mmWave module for the ns-3 network simulator","volume-title":"Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","author":"Mezzavilla","year":"2015"},{"issue":"1","key":"2026032712073827300_ref188","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/3503250","article-title":"NeRF: Representing scenes as neural radiance fields for view synthesis","volume":"65","author":"Mildenhall","year":"2021","journal-title":"Communications of the ACM"},{"key":"2026032712073827300_ref189","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher","year":"2017"},{"key":"2026032712073827300_ref190","doi-asserted-by":"publisher","first-page":"2981","DOI":"10.1109\/ISIT57864.2024.10619283","article-title":"One-shot multiple access channel simulation","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Nema","year":"2024"},{"key":"2026032712073827300_ref191","volume-title":"Mersenne twister (mt19937)","author":"NumPy Developers","year":"2024"},{"key":"2026032712073827300_ref192","article-title":"PCG: A family of simple fast space-efficient statistically good algorithms for random number generation","volume-title":"ACM Transactions on Mathematical Software","author":"O\u2019Neill","year":"2014"},{"issue":"5","key":"2026032712073827300_ref193","doi-asserted-by":"crossref","first-page":"2716","DOI":"10.1109\/TIT.2021.3063140","article-title":"Strong coordination over noisy channels","volume":"67","author":"Obead","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref194","volume-title":"Foundations of Cryptography: Basic Tools","author":"Oded","year":"2004"},{"issue":"3","key":"2026032712073827300_ref195","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/TIT.2010.2103730","article-title":"Performance analysis of the interval algorithm for random number generation based on number systems","volume":"57","author":"Oohama","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref196","first-page":"441","article-title":"Universal almost sure data compression","volume-title":"The Annals of Probability","author":"Ornstein","year":"1990"},{"key":"2026032712073827300_ref197","first-page":"2294","volume-title":"2013 IEEE ISIT","author":"Painsky","year":"2013"},{"key":"2026032712073827300_ref198","first-page":"165","article-title":"DeepSDF: Learning continuous signed distance functions for shape representation","volume-title":"Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition","author":"Park","year":"2019"},{"key":"2026032712073827300_ref199","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/ISIT54713.2023.10206678","volume-title":"2023 IEEE International Symposium on Information Theory (ISIT)","author":"Pase","year":"2023"},{"key":"2026032712073827300_ref200","first-page":"590","article-title":"Iterating von Neumann\u2019s procedure for extracting random bits","volume-title":"The Annals of Statistics","author":"Peres","year":"1992"},{"key":"2026032712073827300_ref201","first-page":"1387","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Phan","year":"2024"},{"issue":"3","key":"2026032712073827300_ref202","doi-asserted-by":"crossref","first-page":"035 009","DOI":"10.1088\/2058-9565\/aac394","article-title":"Theory of channel simulation and bounds for private communication","volume":"3","author":"Pirandola","year":"2018","journal-title":"Quantum Science and Technology"},{"issue":"5","key":"2026032712073827300_ref203","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 Transactions on Information Theory"},{"key":"2026032712073827300_ref204","doi-asserted-by":"crossref","DOI":"10.1017\/9781108966351","volume-title":"Information theory: From coding to learning","author":"Polyanskiy","year":"2024"},{"key":"2026032712073827300_ref205","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1090\/dimacs\/041\/09","article-title":"Coupling from the past: A user\u2019s guide","volume":"41","author":"Propp","year":"1998","journal-title":"Microsurveys in Discrete Probability"},{"issue":"1","key":"2026032712073827300_ref206","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O","article-title":"Exact sampling with coupled Markov chains and applications to statistical mechanics","volume":"9","author":"Propp","year":"1996","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"2026032712073827300_ref207","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","article-title":"Transaction protection by beacons","volume":"27","author":"Rabin","year":"1983","journal-title":"Journal of Computer and System Sciences"},{"key":"2026032712073827300_ref208","first-page":"159","volume-title":"International Zurich Seminar on Information and Communication (IZS 2024). Proceedings","author":"Ramachandran","year":"2024"},{"key":"2026032712073827300_ref209","doi-asserted-by":"publisher","DOI":"10.7249\/MR1418","volume-title":"A Million Random Digits with 100,000 Normal Deviates","author":"RAND Corporation","year":"2001"},{"key":"2026032712073827300_ref210","doi-asserted-by":"crossref","DOI":"10.1017\/9781108671644","volume-title":"Communication Complexity and Applications","author":"Rao","year":"2020"},{"key":"2026032712073827300_ref211","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/3-540-39200-9_35","volume-title":"Advances in Cryptology\u2013EUROCRYPT 2003: International Conference on the Theory and Applications of Cryptographic Techniques","author":"Renner","year":"2003"},{"key":"2026032712073827300_ref212","volume-title":"Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics","author":"R\u00e9nyi","year":"1961"},{"issue":"2","key":"2026032712073827300_ref213","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TIT.1962.1057702","article-title":"Picture coding using pseudo-random noise","volume":"8","author":"Roberts","year":"1962","journal-title":"IRE Transactions on Information Theory"},{"key":"2026032712073827300_ref214","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/ISIT.1991.695225","volume-title":"Proceedings. 1991 IEEE International Symposium on Information Theory","author":"Roche","year":"1991"},{"key":"2026032712073827300_ref215","volume-title":"A First Course in Probability","author":"Ross","year":"2019"},{"key":"2026032712073827300_ref216","first-page":"1127","volume-title":"2019 IEEE ISIT","author":"Rossi","year":"2019"},{"key":"2026032712073827300_ref217","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1109\/ISIT.2013.6620646","volume-title":"2013 IEEE International Symposium on Information Theory","author":"Saldi","year":"2013"},{"issue":"1","key":"2026032712073827300_ref218","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TIT.2014.2373382","article-title":"Randomized quantization and source coding with constrained output distribution","volume":"61","author":"Saldi","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712073827300_ref219","doi-asserted-by":"crossref","first-page":"4984","DOI":"10.1109\/TIT.2015.2450721","article-title":"Output constrained lossy source coding with limited common randomness","volume":"61","author":"Saldi","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2063384.2063405","article-title":"Parallel random numbers: As easy as 1, 2, 3","volume-title":"Proceedings of 2011 international conference for high performance computing, networking, storage and analysis","author":"Salmon","year":"2011"},{"key":"2026032712073827300_ref221","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/ISIT.2014.6874864","volume-title":"2014 IEEE International Symposium on Information Theory","author":"Satpathy","year":"2014"},{"issue":"11","key":"2026032712073827300_ref222","doi-asserted-by":"crossref","first-page":"6081","DOI":"10.1109\/TIT.2016.2588499","article-title":"Secure cascade channel synthesis","volume":"62","author":"Satpathy","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref223","volume-title":"Introduction to data compression","author":"Sayood","year":"2018"},{"issue":"4","key":"2026032712073827300_ref224","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/TCOM.1964.1088973","article-title":"Dither signals and their effect on quantization noise","volume":"12","author":"Schuchman","year":"1964","journal-title":"IEEE Transactions on Communication Technology"},{"key":"2026032712073827300_ref225","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/ISIT57864.2024.10619653","article-title":"Minimal communication-cost statistical learning","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Sefidgaran","year":"2024"},{"key":"2026032712073827300_ref226","first-page":"7680","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Shah","year":"2022"},{"key":"2026032712073827300_ref227","first-page":"4550","volume-title":"ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Shahmiri","year":"2024"},{"issue":"3","key":"2026032712073827300_ref228","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell system technical journal"},{"issue":"4","key":"2026032712073827300_ref229","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"The Bell system technical journal"},{"key":"2026032712073827300_ref230","volume-title":"A theory of semantic communication","author":"Shao","year":"2022"},{"key":"2026032712073827300_ref231","first-page":"26","article-title":"Functional representation lemma: Algorithms and applications","volume-title":"International Zurich Seminar on Information and Communication (IZS 2024)","author":"Shkel","year":"2024"},{"key":"2026032712073827300_ref232","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/ISIT54713.2023.10206466","volume-title":"2023 IEEE International Symposium on Information Theory (ISIT)","author":"Shkel","year":"2023"},{"key":"2026032712073827300_ref233","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/TSP.2020.3046971","article-title":"UVeQFed: Universal vector quantization for federated learning","volume":"69","author":"Shlezinger","year":"2020","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026032712073827300_ref234","first-page":"7462","article-title":"Implicit neural representations with periodic activation functions","volume":"33","author":"Sitzmann","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"4","key":"2026032712073827300_ref235","doi-asserted-by":"crossref","first-page":"1836","DOI":"10.1109\/TIT.2016.2529657","article-title":"The likelihood encoder for lossy compression","volume":"62","author":"Song","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref236","article-title":"Fast channel simulation via error-correcting codes","volume-title":"The Thirtyeighth Annual Conference on Neural Information Processing Systems","author":"Sriramu","year":"2024"},{"key":"2026032712073827300_ref237","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1109\/ISIT57864.2024.10619703","article-title":"Optimal redundancy in exact channel synthesis","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Sriramu","year":"2024"},{"key":"2026032712073827300_ref238","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10710-007-9028-8","article-title":"Compositional pattern producing networks: A novel abstraction of development","volume":"8","author":"Stanley","year":"2007","journal-title":"Genetic programming and evolvable machines"},{"issue":"3","key":"2026032712073827300_ref239","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1109\/18.335877","article-title":"Channel simulation and coding with side information","volume":"40","author":"Steinberg","year":"1994","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712073827300_ref240","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/18.481779","article-title":"Simulation of random processes and rate-distortion theory","volume":"42","author":"Steinberg","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712073827300_ref241","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0375-9601(00)00315-7","article-title":"Towards quantifying non-local information transfer: Finite-bit non-locality","volume":"270","author":"Steiner","year":"2000","journal-title":"Physics Letters A"},{"key":"2026032712073827300_ref242","first-page":"1","volume-title":"2017 IEEE international conference on communications (ICC)","author":"Sun","year":"2017"},{"key":"2026032712073827300_ref243","first-page":"7537","article-title":"Fourier features let networks learn high frequency functions in low dimensional domains","volume":"33","author":"Tancik","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026032712073827300_ref244","volume-title":"Lossy compression with Gaussian diffusion","author":"Theis","year":"2022"},{"key":"2026032712073827300_ref245","article-title":"A coding theorem for the ratedistortion-perception function","volume-title":"Neural Compression: From Information Theory to Applications\u2013Workshop@ ICLR 2021","author":"Theis","year":"2021"},{"key":"2026032712073827300_ref246","first-page":"21 308","volume-title":"International Conference on Machine Learning","author":"Theis","year":"2022"},{"key":"2026032712073827300_ref247","volume-title":"DP-REC: Private & communication-efficient federated learning","author":"Triastcyn","year":"2021"},{"key":"2026032712073827300_ref248","article-title":"Deep generative models for distribution-preserving lossy compression","volume-title":"Advances in neural information processing systems","author":"Tschannen","year":"2018"},{"issue":"6","key":"2026032712073827300_ref249","doi-asserted-by":"crossref","first-page":"2121","DOI":"10.1109\/18.782154","article-title":"Channel simulation by interval algorithm: A performance analysis of interval algorithm","volume":"45","author":"Uyematsu","year":"1999","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref250","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10898-015-0350-z","article-title":"Heuristics for exact nonnegative matrix factorization","volume":"65","author":"Vandaele","year":"2016","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"2026032712073827300_ref251","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/070709967","article-title":"On the complexity of nonnegative matrix factorization","volume":"20","author":"Vavasis","year":"2010","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2026032712073827300_ref252","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/TIT.2017.2768529","article-title":"Strong coordination over multi-hop line networks using channel resolvability codebooks","volume":"64","author":"Vellambi","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref253","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/ISIT.2018.8437787","volume-title":"2018 IEEE International Symposium on Information Theory (ISIT)","author":"Vellambi","year":"2018"},{"issue":"10","key":"2026032712073827300_ref254","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1109\/TAC.2012.2188423","article-title":"A metric between probability distributions on finite sets of different cardinalities and applications to order reduction","volume":"57","author":"Vidyasagar","year":"2012","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026032712073827300_ref255","first-page":"768","article-title":"Various techniques used in connection with random digits","volume":"5","author":"Von Neumann","year":"1963","journal-title":"John von Neumann, Col lected Works"},{"key":"2026032712073827300_ref256","volume-title":"The rate-distortion-perception tradeoff: The role of common randomness","author":"Wagner","year":"2022"},{"issue":"4","key":"2026032712073827300_ref257","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1080\/02664769922386","article-title":"The uniform power distribution","volume":"26","author":"Walker","year":"1999","journal-title":"Journal of Applied Statistics"},{"issue":"2","key":"2026032712073827300_ref258","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1109\/78.823976","article-title":"A theory of nonsubtractive dither","volume":"48","author":"Wannamaker","year":"2000","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2026032712073827300_ref259","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1109\/TIT.2015.2400994","article-title":"Nonasymptotic and second-order achievability bounds for coding with sideinformation","volume":"61","author":"Watanabe","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712073827300_ref260","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1109\/TIT.2019.2946235","article-title":"Interval algorithm for random number generation: Information spectrum approach","volume":"66","author":"Watanabe","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref261","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1109\/ISIT.2014.6875160","volume-title":"2014 IEEE International Symposium on Information Theory","author":"Watanabe","year":"2014"},{"key":"2026032712073827300_ref262","first-page":"261","article-title":"Recent contributions to the mathematical theory of communication","volume-title":"ETC: a Review of General Semantics","author":"Weaver","year":"1953"},{"issue":"11","key":"2026032712073827300_ref263","doi-asserted-by":"crossref","first-page":"3718","DOI":"10.1109\/TIT.2005.856982","article-title":"The empirical distribution of rate-constrained source codes","volume":"51","author":"Weissman","year":"2005","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712073827300_ref264","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/TIT.1985.1057042","article-title":"The discrete memoryless multiple-access channel with cribbing encoders","volume":"31","author":"Willems","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref265","first-page":"141","article-title":"Layered multishift coupling for use in perfect sampling algorithms (with a primer on CFTP)","volume":"26","author":"Wilson","year":"2000","journal-title":"Monte Carlo Methods"},{"key":"2026032712073827300_ref266","volume-title":"Compression of sources of probability distributions and density operators","author":"Winter","year":"2002"},{"issue":"6","key":"2026032712073827300_ref267","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/5.286191","article-title":"The sliding-window Lempel-Ziv algorithm is asymptotically optimal","volume":"82","author":"Wyner","year":"1994","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"2026032712073827300_ref268","doi-asserted-by":"crossref","first-page":"163","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 Transactions on Information Theory"},{"issue":"8","key":"2026032712073827300_ref269","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","article-title":"The wire-tap channel","volume":"54","author":"Wyner","year":"1975","journal-title":"Bell system technical journal"},{"issue":"10","key":"2026032712073827300_ref270","doi-asserted-by":"crossref","first-page":"6234","DOI":"10.1109\/TIT.2019.2917182","article-title":"Exact exponent for soft covering","volume":"65","author":"Yagli","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref271","volume-title":"Layered randomized quantization for communication-efficient and privacy-preserving distributed learning","author":"Yan","year":"2023"},{"key":"2026032712073827300_ref272","first-page":"573","article-title":"Improving inference for neural image compression","volume":"33","author":"Yang","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"2026032712073827300_ref273","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1561\/0600000107","article-title":"An introduction to neural data compression","volume":"15","author":"Yang","year":"2023","journal-title":"Foundations and Trends\u00ae in Computer Graphics and Vision"},{"key":"2026032712073827300_ref274","first-page":"209","article-title":"Some complexity questions related to distributive computing","volume-title":"Proceedings of the eleventh annual ACM symposium on Theory of computing","author":"Yao","year":"1979"},{"key":"2026032712073827300_ref275","doi-asserted-by":"publisher","first-page":"1849","DOI":"10.1109\/ISIT.2013.6620547","article-title":"Non-asymptotic output statistics of random binning and its applications","volume-title":"2013 IEEE ISIT","author":"Yassaee","year":"2013"},{"key":"2026032712073827300_ref276","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1109\/ISIT.2019.8849341","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Yassaee","year":"2019"},{"key":"2026032712073827300_ref277","first-page":"301","volume-title":"Proc. IEEE Int. Symp. Inf. Theory","author":"Yassaee","year":"2015"},{"issue":"11","key":"2026032712073827300_ref278","doi-asserted-by":"crossref","first-page":"6760","DOI":"10.1109\/TIT.2014.2351812","article-title":"Achievability proof via output statistics of random binning","volume":"60","author":"Yassaee","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712073827300_ref279","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1109\/TIT.2015.2428236","article-title":"Channel simulation via interactive communications","volume":"61","author":"Yassaee","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref280","volume-title":"Information theory and network coding","author":"Yeung","year":"2008"},{"issue":"3","key":"2026032712073827300_ref281","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1109\/TIT.2018.2857763","article-title":"Asymptotic coupling and its applications in information theory","volume":"65","author":"Yu","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712073827300_ref282","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.1109\/TIT.2019.2944625","article-title":"Exact channel synthesis","volume":"66","author":"Yu","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712073827300_ref283","doi-asserted-by":"crossref","first-page":"3366","DOI":"10.1109\/TIT.2020.2970396","article-title":"On exact and \u221e-r\u00e9nyi common informations","volume":"66","author":"Yu","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712073827300_ref284","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1561\/0100000122","article-title":"Common information, noise stability, and their extensions","volume":"19","author":"Yu","year":"2022","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"key":"2026032712073827300_ref285","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139045520","volume-title":"Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation and Multiuser Information Theory","author":"Zamir","year":"2014"},{"issue":"2","key":"2026032712073827300_ref286","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/18.119699","article-title":"On universal quantization by randomized uniform\/lattice quantizers","volume":"38","author":"Zamir","year":"1992","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712073827300_ref287","first-page":"11 517","article-title":"Universal ratedistortion-perception representations for lossy compression","volume":"34","author":"Zhang","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026032712073827300_ref288","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/2090236.2090241","article-title":"Quantum strategic game theory","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference","author":"Zhang","year":"2012"},{"issue":"1","key":"2026032712073827300_ref289","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/18.567651","article-title":"The redundancy of source coding with a fidelity criterion. 1. known statistics","volume":"43","author":"Zhang","year":"1997","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712073827300_ref290","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TIT.1985.1057034","article-title":"On universal quantization","volume":"31","author":"Ziv","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712073827300_ref291","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/21\/6\/847\/11160666\/0100000141en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/21\/6\/847\/11160666\/0100000141en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:46Z","timestamp":1777471846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/21\/6\/847\/1332827\/Channel-Simulation-Theory-and-Applications-to"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,17]]},"references-count":291,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12,17]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000141","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,17]]}}}