{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:55:30Z","timestamp":1774630530629,"version":"3.50.1"},"reference-count":232,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,1,30]]},"abstract":"<jats:p>This monograph offers a toolbox of mathematical techniques that have been effective and widely applicable in information-theoretic analyses. The first tool is a generalization of the method of types to Gaussian settings, and then to general exponential families. The second tool is Laplace and saddle-point integration, which allow to refine the results of the method of types, and can obtain various precise asymptotic results. The third is the type class enumeration method, a principled method to evaluate the exact random-coding exponent of coded systems, which results in the best known exponent in various problems. The fourth is a subset of tools aimed at evaluating the expectation of non-linear functions of random variables, either via integral representations, by a refinement of Jensen\u2019s inequality via change-of-measure, by complementing Jensen\u2019s inequality with a reversed inequality, or by a class of generalized Jensen\u2019s inequalities that are applicable for functions beyond convex\/concave. Various examples of all these tools are provided throughout the monograph.<\/jats:p>","DOI":"10.1561\/0100000142","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T07:25:18Z","timestamp":1738221918000},"page":"1-184","source":"Crossref","is-referenced-by-count":3,"title":["A Toolbox for Refined Information-Theoretic Analyses with Applications"],"prefix":"10.1561","volume":"22","author":[{"given":"Neri","family":"Merhav","sequence":"first","affiliation":[{"name":"Technion - Israel Institute of Technology ,","place":["Israel"]}]},{"given":"Nir","family":"Weinberger","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology ,","place":["Israel"]}]}],"member":"140","published-online":{"date-parts":[[2025,1,30]]},"reference":[{"issue":"4","key":"2026032712074039600_ref001","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1986.1057194","article-title":"Hypothesis testing with communication constraints","volume":"32","author":"Ahlswede","year":"1986","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref002","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/TIT.1982.1056514","article-title":"Good codes can be produced by a few permutations","volume":"28","author":"Ahlswede","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref003","doi-asserted-by":"publisher","DOI":"10.1002\/mma.7889","article-title":"A new extension of quantum Simpson\u2019s and quantum Newton\u2019s inequalities for quantum differentiable convex functions","volume-title":"Mathematical Methods in the Applied Sciences","author":"Ali","year":"2021"},{"issue":"1","key":"2026032712074039600_ref004","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1111\/j.2517-6161.1966.tb00626.x","article-title":"A general class of coefficients of divergence of one distribution from another","volume":"28","author":"Ali","year":"1966","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"issue":"8","key":"2026032712074039600_ref005","doi-asserted-by":"crossref","first-page":"4417","DOI":"10.1109\/TIT.2014.2323418","article-title":"Moderate deviations in channel coding","volume":"60","author":"Altu\u011f","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712074039600_ref006","doi-asserted-by":"crossref","first-page":"6005","DOI":"10.1109\/TIT.2014.2345374","article-title":"Refinement of the random coding bound","volume":"60","author":"Altu\u011f","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref007","doi-asserted-by":"publisher","first-page":"690","DOI":"10.3390\/e22060690","article-title":"An upper bound on the error induced by saddlepoint approximations -applications to information theory","volume":"22","author":"Anade","year":"2020","journal-title":"Entropy"},{"issue":"7","key":"2026032712074039600_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 Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref009","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/18.669158","article-title":"Guessing subject to distortion","volume":"44","author":"Arikan","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref010","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TIT.1973.1055007","article-title":"On the converse to the coding theorem for discrete memoryless channels (corresp.)","volume":"19","author":"Arimoto","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"2026032712074039600_ref011","doi-asserted-by":"crossref","first-page":"5070","DOI":"10.1109\/TIT.2018.2836668","article-title":"Exact random coding exponents and universal decoders for the asymmetric broadcast channel","volume":"64","author":"Averbuch","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref012","doi-asserted-by":"crossref","first-page":"3412","DOI":"10.1109\/TIT.2019.2898206","article-title":"Expurgated bounds for the asymmetric broadcast channel","volume":"65","author":"Averbuch","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref013","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1214\/aoms\/1177705674","article-title":"On deviations of the sample mean","volume":"31","author":"Bahadur","year":"1960","journal-title":"Ann. Math. Statist."},{"issue":"9","key":"2026032712074039600_ref014","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. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref015","first-page":"3","article-title":"Simple methods for deriving lower bounds in the theory of codes","volume":"27","author":"Bassalygo","year":"1991","journal-title":"Probl. Pered. Inform"},{"issue":"2","key":"2026032712074039600_ref016","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TIT.1973.1054980","article-title":"Random coding theorem for broadcast channels with degraded components","volume":"19","author":"Bergmans","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref017","first-page":"1064","volume-title":"Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1","author":"Berrou"},{"key":"2026032712074039600_ref018","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1214\/aoms\/1177705136","article-title":"Statistical methods in Markov chains","volume":"32","author":"Billingsley","year":"1961","journal-title":"Ann. Math. Statist."},{"issue":"4","key":"2026032712074039600_ref019","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. Inf. Theory"},{"key":"2026032712074039600_ref020","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","author":"Boucheron","year":"2013"},{"key":"2026032712074039600_ref021","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"Boyd","year":"2004"},{"key":"2026032712074039600_ref022","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1214\/aoms\/1177693067","article-title":"Asymptotically optimal tests for finite Markov chains","volume":"42","author":"Boza","year":"1971","journal-title":"Ann. Math. Stat."},{"key":"2026032712074039600_ref023","volume-title":"Asymptotic Methods in Analysis","author":"de Bruijn","year":"1981"},{"issue":"3","key":"2026032712074039600_ref024","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1007\/s10957-020-01726-6","article-title":"Some new quantum Hermite-Hadamard like inequalities for coordinated convex functions","volume":"186","author":"Budak","year":"2020","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2026032712074039600_ref025","first-page":"1","article-title":"Further reverse results for Jensen\u2019s discrete inequality and applications in information theory","volume":"2","author":"Budimir","year":"2001","journal-title":"Journal of Inequalities in Pure and Applied Mathematics"},{"issue":"4","key":"2026032712074039600_ref026","first-page":"10","article-title":"Data transmission over a discrete channel with feedback. random transmission time","volume":"12","author":"Burnashev","year":"1976","journal-title":"Problemy peredachi informatsii"},{"issue":"2","key":"2026032712074039600_ref027","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1109\/TIT.2019.2922185","article-title":"Exact error and erasure exponents for the asymmetric broadcast channel","volume":"66","author":"Cao","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref028","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1109\/TIT.2012.2236914","article-title":"Asynchronous capacity per unit cost","volume":"59","author":"Chandar","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref029","doi-asserted-by":"crossref","first-page":"3725","DOI":"10.1109\/TIT.2008.926444","article-title":"Optimal sequential frame synchronization","volume":"54","author":"Chandar","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref030","first-page":"1426","volume-title":"On universal variable-rate Slepian-Wolf coding","author":"Chen"},{"issue":"2","key":"2026032712074039600_ref031","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4234.905935","article-title":"On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit","volume":"5","author":"Chung","year":"2001","journal-title":"IEEE Communications letters"},{"issue":"3","key":"2026032712074039600_ref032","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TIT.1983.1056659","article-title":"Writing on dirty paper (corresp.)","volume":"29","author":"Costa","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref033","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast channels","volume":"18","author":"Cover","year":"1972","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref034","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref035","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TIT.1981.1056357","article-title":"An achievable rate region for the multiple -access channel with feedback","volume":"27","author":"Cover","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref036","volume-title":"Elements of Information Theory","author":"Cover","year":"2006","edition":"2nd"},{"issue":"1-2","key":"2026032712074039600_ref037","first-page":"85","article-title":"Eine informationstheoretische ungleichung und ihre anwendung auf den beweis der ergodizit\u00e4t von markoffschen ketten","volume":"8","author":"Csisz\u00e1r","year":"1963","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"issue":"6","key":"2026032712074039600_ref038","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 Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref039","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","article-title":"Broadcast channels with confidential messages","volume":"24","author":"Csisz\u00e1r","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref040","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.1981.1056281","article-title":"Graph decomposition: A new key to coding theorems","volume":"27","author":"Csisz\u00e1r","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref041","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"2011"},{"key":"2026032712074039600_ref042","first-page":"107","volume-title":"A new look at the error exponent of discrete memoryless channels","author":"Csisz\u00e1r"},{"issue":"4","key":"2026032712074039600_ref043","first-page":"3","article-title":"Bounds on the average error probability for a code ensemble with fixed composition","volume":"16","author":"D\u2019yachkov","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712074039600_ref044","first-page":"1066","volume-title":"On reliability of content identification from databases based on noisy queries","author":"Dasarathy"},{"key":"2026032712074039600_ref045","volume-title":"Upper and lower bounds on the reliability of content identification","author":"Dasarathy"},{"issue":"6","key":"2026032712074039600_ref046","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TIT.1973.1055092","article-title":"Universal noiseless coding","volume":"29","author":"Davisson","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref047","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/TIT.1981.1056377","article-title":"The error exponent for noiseless encoding of finite ergodic Markov sources","volume":"27","author":"Davisson","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-3","key":"2026032712074039600_ref048","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0012-365X(96)00107-0","article-title":"A lower bound on the probability of a union","volume":"169","author":"De Caen","year":"1997","journal-title":"Discrete mathematics"},{"key":"2026032712074039600_ref049","volume-title":"Large Deviations and Applications","author":"Dembo","year":"1993"},{"issue":"2","key":"2026032712074039600_ref050","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1103\/PhysRevLett.45.79","article-title":"Random-energy model: Limit of a family of disordered models","volume":"45","author":"Derrida","year":"1980","journal-title":"Physical Review Letters"},{"key":"2026032712074039600_ref051","doi-asserted-by":"crossref","DOI":"10.1016\/0370-1573(80)90076-9","volume-title":"The random energy model","author":"Derrida","year":"1980"},{"issue":"5","key":"2026032712074039600_ref052","doi-asserted-by":"crossref","first-page":"2613","DOI":"10.1103\/PhysRevB.24.2613","article-title":"Random-energy model: An exactly solvable model of disordered systems","volume":"24","author":"Derrida","year":"1981","journal-title":"Physical Review B"},{"issue":"2","key":"2026032712074039600_ref053","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/cpa.3160360204","article-title":"Asymptotic evaluation of certain Markov process expectations for large time. iv","volume":"36","author":"Donsker","year":"1983","journal-title":"Communications on pure and applied mathematics"},{"key":"2026032712074039600_ref054","doi-asserted-by":"crossref","unstructured":"S. S.\n              Dragomir\n            \n          , \u201cSome reverses of the Jensen inequality for functions of selfadjoint operators in Hilbert spaces,\u201d Journal of Inequalities and Applications, 2010. DOI: 10.1155\/2010\/496821.","DOI":"10.1155\/2010\/496821"},{"key":"2026032712074039600_ref055","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1017\/S0004972712001098","article-title":"Some reverses of the Jensen inequality with applications","volume":"87","author":"Dragomir","year":"2013","journal-title":"Bulletin of the Australian Mathematical Society"},{"key":"2026032712074039600_ref056","doi-asserted-by":"crossref","DOI":"10.1017\/9781108565462","volume-title":"Analytic Information Theory: From Compression to Learning","author":"Drmota","year":"2023"},{"issue":"1","key":"2026032712074039600_ref057","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/TIT.1979.1056003","article-title":"Reliability function of a discrete memoryless channel at rates above capacity (corresp.)","volume":"25","author":"Dueck","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref058","doi-asserted-by":"crossref","DOI":"10.1002\/9781118165904","volume-title":"A Weak Convergence Approach to the Theory of Large Deviations","author":"Dupuis","year":"1997"},{"key":"2026032712074039600_ref059","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"El Gamal","year":"2011"},{"key":"2026032712074039600_ref060","first-page":"37","volume-title":"Coding for noisy channels","author":"Elias"},{"key":"2026032712074039600_ref061","first-page":"94","volume-title":"List decoding for noisy channels","author":"Elias"},{"issue":"12","key":"2026032712074039600_ref062","doi-asserted-by":"crossref","first-page":"6854","DOI":"10.1109\/TIT.2016.2616900","article-title":"Coding in the finite-blocklength regime: Bounds based on Laplace integrals and their asymptotic approximations","volume":"62","author":"Erseghe","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712074039600_ref063","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1103\/PhysRevE.48.1046","article-title":"Interface growth and Burgers turbulence: The problem of random initial conditions","volume":"48","author":"Esipov","year":"1993","journal-title":"Physical Review E"},{"issue":"1","key":"2026032712074039600_ref064","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TIT.2009.2034892","article-title":"Error exponents of optimum decoding for the interference channel","volume":"56","author":"Etkin","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref065","doi-asserted-by":"crossref","DOI":"10.1063\/1.3057290","volume-title":"Transmission of Information: A Statistical Theory of Communications","author":"Fano","year":"1961"},{"issue":"6","key":"2026032712074039600_ref066","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1109\/TIT.2002.1003837","article-title":"Universal composite hypothesis testing: A competitive minimax approach","volume":"48","author":"Feder","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref067","doi-asserted-by":"crossref","volume-title":"Saddlepoint approximations of lower and upper bounds to the error probability in channel coding","author":"Font-Segura","DOI":"10.1109\/CISS.2018.8362304"},{"issue":"2","key":"2026032712074039600_ref068","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/TIT.1968.1054129","article-title":"Exponential error bounds for erasure, list, and decision feedback schemes","volume":"14","author":"Forney","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref069","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low-density parity-check codes","volume":"8","author":"Gallager","year":"1962","journal-title":"IRE Transactions on information theory"},{"issue":"1","key":"2026032712074039600_ref070","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.1965.1053730","article-title":"A simple derivation of the coding theorem and some applications","volume":"11","author":"Gallager","year":"1965","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref071","volume-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1968"},{"issue":"2","key":"2026032712074039600_ref072","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TIT.1973.1054971","article-title":"The random coding bound is tight for the average code (corresp.)","volume":"19","author":"Gallager","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref073","first-page":"3","article-title":"Capacity and coding for degraded broadcast channels","volume":"10","author":"Gallager","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712074039600_ref074","volume-title":"Source coding with side information and universal coding","author":"Gallager","year":"1976"},{"issue":"1","key":"2026032712074039600_ref075","first-page":"19","article-title":"Coding for channels with random parameters","volume":"9","author":"Gel\u2019fand","year":"1980","journal-title":"Probl. Contr. Inform. Theory"},{"key":"2026032712074039600_ref076","first-page":"584","volume-title":"Random-coding error exponent of variable-length codes with a single-bit noiseless feedback","author":"Ginzach"},{"key":"2026032712074039600_ref077","first-page":"97","article-title":"Nonprobabilitistic mutual information without memory","volume":"4","author":"Goppa","year":"1975","journal-title":"Problems of Control and Inform., Theory"},{"key":"2026032712074039600_ref078","unstructured":"M.\n              Grant\n            , S. P.Boyd, and Y.Ye, \u201cCVX users\u2019 guide,\u201d 2009. URL: http:\/\/www.%20stanford.%20edu\/boyd\/software.%20html."},{"issue":"6","key":"2026032712074039600_ref079","doi-asserted-by":"crossref","first-page":"2300","DOI":"10.1109\/18.720540","article-title":"Statistical inference under multiterminal data compression","volume":"44","author":"Han","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref080","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. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref081","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/18.42171","article-title":"Exponential-type error probabilities for multiterminal hypothesis testing","volume":"35","author":"Han","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref082","first-page":"37","article-title":"Bounds for the exponent of the probability of error for a semicontinuous memoryless channel","volume":"4","author":"Haroutunian","year":"1968","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"2026032712074039600_ref083","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 Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref084","doi-asserted-by":"crossref","first-page":"3989","DOI":"10.1109\/TIT.2011.2110950","article-title":"Exponential decreasing rate of leaked information in universal random privacy amplification","volume":"57","author":"Hayashi","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2026032712074039600_ref085","doi-asserted-by":"crossref","first-page":"6560","DOI":"10.1109\/TIT.2015.2495258","article-title":"Asymmetric evaluations of erasure and undetected error probabilities","volume":"61","author":"Hayashi","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref086","volume-title":"Analytic Function Theory","author":"Hille","year":"1959"},{"key":"2026032712074039600_ref087","first-page":"1844","volume-title":"Exact asymptotics of random coding error probability for general memoryless channels","author":"Honda"},{"issue":"4","key":"2026032712074039600_ref088","doi-asserted-by":"crossref","first-page":"1606","DOI":"10.1109\/TIT.2015.2405534","article-title":"Universal decoding for Gaussian intersymbol interference channels","volume":"61","author":"Huleihel","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712074039600_ref089","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1109\/TIT.2016.2630707","article-title":"Random coding error exponents for the two-user interference channel","volume":"63","author":"Huleihel","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"2026032712074039600_ref090","doi-asserted-by":"crossref","first-page":"4499","DOI":"10.1109\/TIT.2019.2900222","article-title":"Gaussian intersymbol interference channels with mismatch","volume":"65","author":"Huleihel","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712074039600_ref091","doi-asserted-by":"crossref","first-page":"5403","DOI":"10.1109\/TIT.2016.2598350","article-title":"Erasure\/list random coding error exponents are not universally achievable","volume":"62","author":"Huleihel","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref092","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TIT.1981.1056322","article-title":"Generalization of Huffman coding to minimize the probability of buffer overflow","volume":"27","author":"Humblet","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2-3","key":"2026032712074039600_ref093","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1561\/0100000051","article-title":"Biometric security from an information-theoretical perspective","volume":"7","author":"Ignatenko","year":"2012","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"issue":"5","key":"2026032712074039600_ref094","doi-asserted-by":"crossref","first-page":"2729","DOI":"10.1109\/TIT.2015.2402972","article-title":"Compression for quadratic similarity queries","volume":"61","author":"Ingber","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3-4","key":"2026032712074039600_ref095","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<467::AID-RSA15>3.0.CO;2-W","article-title":"New versions of Suen\u2019s correlation inequality","volume":"13","author":"Janson","year":"1998","journal-title":"Random Structures and Algorithms"},{"key":"2026032712074039600_ref096","first-page":"213","volume-title":"On reversing Jensen\u2019s inequality","author":"Jebara"},{"issue":"3","key":"2026032712074039600_ref097","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1109\/TIT.1968.1054147","article-title":"Buffer overflow in variable length coding of fixed rate sources","volume":"14","author":"Jelinek","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref098","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TIT.1968.1054148","article-title":"Evaluation of expurgated bound exponents","volume":"14","author":"Jelinek","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref099","volume-title":"Probabilistic Information Theory","author":"Jelinek","year":"1968"},{"key":"2026032712074039600_ref100","doi-asserted-by":"crossref","DOI":"10.1002\/9781119098799","volume-title":"Fundamentals of Convolutional Coding","author":"Johannesson","year":"2015"},{"issue":"1","key":"2026032712074039600_ref101","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.2010.2090233","article-title":"Error exponents for broadcast channels with degraded message sets","volume":"57","author":"Kaspi","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref102","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. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref103","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1561\/0100000025","article-title":"Channel coding in the presence of side information","volume":"4","author":"Keshet","year":"2008","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"key":"2026032712074039600_ref104","doi-asserted-by":"crossref","first-page":"2577","DOI":"10.1002\/mma.6066","article-title":"Converses of Jensen inequality derived from the Green functions with applications in information theory","volume":"43","author":"Khan","year":"2020","journal-title":"Mathematical Methods in Applied Sciences"},{"issue":"3","key":"2026032712074039600_ref105","article-title":"New converses of Jensen inequality via Green functions with applications","volume":"114","author":"Khan","year":"2020","journal-title":"Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A, Matematicas"},{"issue":"1","key":"2026032712074039600_ref106","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/TIT.1977.1055655","article-title":"General broadcast channels with degraded message sets","volume":"23","author":"K\u00f6rner","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref107","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1109\/TIT.1980.1056275","article-title":"Universally attainable error exponents for broadcast channels with degraded message sets","volume":"26","author":"K\u00f6rner","year":"1980","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712074039600_ref108","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","article-title":"The performance of universal encoding","volume":"27","author":"Krichevsky","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"2026032712074039600_ref109","doi-asserted-by":"crossref","first-page":"4831","DOI":"10.1109\/TWC.2020.2987573","article-title":"Saddlepoint approximations for short-packet wireless communications","volume":"19","author":"Lancho","year":"2020","journal-title":"IEEE Trans. on Wireless Communications"},{"key":"2026032712074039600_ref110","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2769-2","volume-title":"Theory of Point Estimation","author":"Lehmann","year":"1983"},{"issue":"4-5","key":"2026032712074039600_ref111","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/0100000036","article-title":"Information theoretic security","volume":"5","author":"Liang","year":"2009","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"key":"2026032712074039600_ref112","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"2026032712074039600_ref113","first-page":"2905","volume-title":"Random-coding bounds for threshold decoders: Error exponent and saddlepoint approximation","author":"Martinez"},{"key":"2026032712074039600_ref114","doi-asserted-by":"crossref","volume-title":"Saddlepoint approximation of random-coding bounds","author":"Martinez","DOI":"10.1109\/ITA.2011.5743590"},{"issue":"5","key":"2026032712074039600_ref115","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/18.42231","article-title":"On the estimation of the model order in exponential families","volume":"35","author":"Merhav","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref116","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/18.243443","article-title":"Universal decoding for memoryless Gaussian channels with a deterministic interference","volume":"39","author":"Merhav","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712074039600_ref117","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/TIT.2002.807301","article-title":"A large-deviations notion of perfect secrecy","volume":"49","author":"Merhav","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712074039600_ref118","doi-asserted-by":"crossref","first-page":"4439","DOI":"10.1109\/TIT.2008.929004","article-title":"Error exponents of erasure\/list decoding revisited via moments of distance enumerators","volume":"54","author":"Merhav","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref119","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/TIT.2008.2008133","article-title":"Relations between random coding exponents and the statistical physics of random codes","volume":"55","author":"Merhav","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-2","key":"2026032712074039600_ref120","doi-asserted-by":"crossref","DOI":"10.1561\/0100000052","article-title":"Statistical physics and information theory","volume":"6","author":"Merhav","year":"2009","journal-title":"Foundations and Trends in Communications and Information Theory"},{"issue":"4","key":"2026032712074039600_ref121","doi-asserted-by":"crossref","first-page":"343","DOI":"10.4310\/CIS.2011.v11.n4.a3","article-title":"On optimum strategies for minimizing exponential moments of a given cost function","volume":"11","author":"Merhav","year":"2011","journal-title":"Communications in Information and Systems"},{"key":"2026032712074039600_ref122","doi-asserted-by":"crossref","first-page":"P09017","DOI":"10.1088\/1742-5468\/2011\/09\/P09017","article-title":"Subset-sum phase transitions and data compression","volume":"2011","author":"Merhav","year":"2011","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"2026032712074039600_ref123","article-title":"Another look at expurgated bounds and their statistical-mechanical interpretation","volume-title":"arXiv preprint","author":"Merhav","year":"2013"},{"issue":"9","key":"2026032712074039600_ref124","doi-asserted-by":"crossref","first-page":"5566","DOI":"10.1109\/TIT.2013.2266657","article-title":"Universal decoding for arbitrary channels relative to a given class of decoding metrics","volume":"59","author":"Merhav","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref125","doi-asserted-by":"crossref","first-page":"4463","DOI":"10.1109\/TIT.2014.2328602","article-title":"Erasure\/list exponents for Slepian-Wolf decoding","volume":"60","author":"Merhav","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2026032712074039600_ref126","doi-asserted-by":"crossref","first-page":"7606","DOI":"10.1109\/TIT.2014.2361765","article-title":"Exact correct-decoding exponent of the wiretap channel decoder","volume":"60","author":"Merhav","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712074039600_ref127","doi-asserted-by":"crossref","first-page":"6024","DOI":"10.1109\/TIT.2014.2348554","article-title":"Exact random coding error exponents of optimal bin index decoding","volume":"60","author":"Merhav","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2026032712074039600_ref128","doi-asserted-by":"crossref","first-page":"6749","DOI":"10.1109\/TIT.2014.2351393","article-title":"List decoding - random coding exponents and expurgated exponents","volume":"60","author":"Merhav","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref129","doi-asserted-by":"crossref","first-page":"2454","DOI":"10.1109\/TIT.2015.2412112","article-title":"Statistical physics of random binning","volume":"61","author":"Merhav","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref130","doi-asserted-by":"crossref","first-page":"17","DOI":"10.4310\/CIS.2016.v16.n1.a2","article-title":"Universal decoding for source-channel coding with side information","volume":"16","author":"Merhav","year":"2016","journal-title":"Communications in Information and Systems"},{"issue":"10","key":"2026032712074039600_ref131","doi-asserted-by":"crossref","first-page":"6827","DOI":"10.1109\/TIT.2017.2736554","article-title":"Correction to \u201cthe generalized stochastic likelihood decoder: Random coding and expurgated bounds\u201d","volume":"63","author":"Merhav","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref132","first-page":"2696","article-title":"Reliability of universal decoding based on vector-quantized codewords","volume":"63","author":"Merhav","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref133","doi-asserted-by":"crossref","first-page":"5039","DOI":"10.1109\/TIT.2017.2689787","article-title":"The generalized stochastic likelihood decoder: Random coding and expurgated bounds","volume":"63","author":"Merhav","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref134","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1109\/TIT.2018.2873132","article-title":"Ensemble performance of biometric authentication systems based on secret key generation","volume":"65","author":"Merhav","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2026032712074039600_ref135","doi-asserted-by":"crossref","first-page":"6223","DOI":"10.1109\/TIT.2018.2834503","article-title":"Error exponents of typical random codes","volume":"64","author":"Merhav","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2026032712074039600_ref136","doi-asserted-by":"crossref","first-page":"7636","DOI":"10.1109\/TIT.2018.2865919","article-title":"Lower bounds on exponential moments of the quadratic error in parameter estimation","volume":"64","author":"Merhav","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref137","doi-asserted-by":"crossref","first-page":"3456","DOI":"10.1109\/TIT.2019.2963392","article-title":"A Lagrange-dual lower bound to the error exponent of the typical random code","volume":"66","author":"Merhav","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2026032712074039600_ref138","doi-asserted-by":"crossref","first-page":"8164","DOI":"10.1109\/TIT.2019.2917175","article-title":"Error exponents of typical random codes for the colored Gaussian channel","volume":"65","author":"Merhav","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref139","doi-asserted-by":"crossref","first-page":"2067","DOI":"10.1109\/TIT.2019.2942624","article-title":"Error exponents of typical random trellis codes","volume":"66","author":"Merhav","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref140","doi-asserted-by":"crossref","first-page":"2652","DOI":"10.1109\/TIT.2020.3047911","article-title":"Universal decoding for asynchronous Slepian-Wolf encoding","volume":"67","author":"Merhav","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712074039600_ref141","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1109\/TIT.2021.3126980","article-title":"On more general distributions of random binning for Slepian-Wolf encoding","volume":"68","author":"Merhav","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref142","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3390\/info13010039","article-title":"Reversing Jensen\u2019s inequality for information-theoretic analyses","volume":"13","author":"Merhav","year":"2022","journal-title":"Information"},{"issue":"7","key":"2026032712074039600_ref143","doi-asserted-by":"crossref","first-page":"4746","DOI":"10.1109\/TIT.2023.3253133","article-title":"D-semifaithful codes that are universal over both memoryless sources and distortion measures","volume":"69","author":"Merhav","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref144","doi-asserted-by":"publisher","first-page":"752","DOI":"10.3390\/e25050752","article-title":"Some families of Jensen-like inequalities with application to information theory","volume":"25","author":"Merhav","year":"2023","journal-title":"Entropy"},{"issue":"5","key":"2026032712074039600_ref145","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1109\/TIT.2007.894695","article-title":"Minimax universal decoding with an erasure option","volume":"53","author":"Merhav","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref146","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1109\/18.340469","article-title":"On information rates for mismatched decoders","volume":"40","author":"Merhav","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref147","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TIT.2007.911210","article-title":"Optimal watermark embedding and detection strategies under limited detection resources","volume":"54","author":"Merhav","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref148","doi-asserted-by":"publisher","first-page":"51","DOI":"10.3390\/e22010051","article-title":"An integral representation of the logarithmic function with applications in information theory","volume":"22","author":"Merhav","year":"2020","journal-title":"Entropy"},{"issue":"6","key":"2026032712074039600_ref149","doi-asserted-by":"publisher","first-page":"707","DOI":"10.3390\/e22060707","article-title":"Some useful integral representations for information-theoretic analyses","volume":"22","author":"Merhav","year":"2020","journal-title":"Entropy"},{"issue":"1","key":"2026032712074039600_ref150","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/TIT.2003.821993","article-title":"On universal simulation of information sources using training data","volume":"50","author":"Merhav","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref151","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001","volume-title":"Information, Physics and Computation","author":"M\u00e9zard","year":"2009"},{"key":"2026032712074039600_ref152","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher","year":"2017"},{"issue":"4","key":"2026032712074039600_ref153","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/TIT.2016.2643681","article-title":"The log-volume of optimal codes for memoryless channels, asymptotically within a few nats","volume":"63","author":"Moulin","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref154","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/TIT.2007.892789","article-title":"Capacity and random-coding exponents for channel coding with side information","volume":"53","author":"Moulin","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref155","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TIT.1985.1057036","article-title":"Large deviations, hypotheses testing, and source coding for finite Markov chains","volume":"31","author":"Natarajan","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2026032712074039600_ref156","doi-asserted-by":"crossref","first-page":"5095","DOI":"10.1109\/TIT.2014.2331952","article-title":"Error exponent for multiple -access channels: Lower bounds","volume":"60","author":"Nazari","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref157","article-title":"Typicality graphs: Large deviation analysis","volume-title":"arXiv preprint","author":"Nazari","year":"2010"},{"key":"2026032712074039600_ref158","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s00365-014-9245-3","article-title":"Ap\u00e9ry polynomials and the multivariate saddle point method","volume":"40","author":"Neuschel","year":"2014","journal-title":"Contr. Approx."},{"key":"2026032712074039600_ref159","volume-title":"Introduction to Complex Analysis","author":"Nevanlinna","year":"2007"},{"issue":"6","key":"2026032712074039600_ref160","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. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref161","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/TIT.1984.1056935","article-title":"The capacity of the white Gaussian multiple access channel with feedback","volume":"30","author":"Ozarow","year":"1984","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref162","volume-title":"Probability, Random Variables, and Stochastic Processes","author":"Papoulis","year":"1991"},{"key":"2026032712074039600_ref163","first-page":"287","volume-title":"On the secrecy exponent of the wire-tap channel","author":"Parizi"},{"issue":"1","key":"2026032712074039600_ref164","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TIT.2016.2628307","article-title":"Exact random coding secrecy exponents for the wiretap channel","volume":"63","author":"Parizi","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref165","first-page":"12","article-title":"Random coding bounds for discrete memoryless channels","volume":"18","author":"Poltyrev","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"2026032712074039600_ref166","volume-title":"Channel coding: Non-asymptotic fundamental limits","author":"Polyanskiy","year":"2010"},{"key":"2026032712074039600_ref167","first-page":"1334","volume-title":"Channel dispersion and moderate deviations limits for memoryless channels","author":"Polyanskiy"},{"issue":"5","key":"2026032712074039600_ref168","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. Inf. Theory"},{"issue":"1-2","key":"2026032712074039600_ref169","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000064","article-title":"Concentration of measure inequalities in information theory, communications, and coding","volume":"10","author":"Raginsky","year":"2013","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"issue":"10","key":"2026032712074039600_ref170","doi-asserted-by":"crossref","first-page":"6282","DOI":"10.1109\/TIT.2012.2206793","article-title":"On the optimality of binning for distributed hypothesis testing","volume":"58","author":"Rahman","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref171","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"Richardson","year":"2008"},{"issue":"19","key":"2026032712074039600_ref172","doi-asserted-by":"crossref","first-page":"2968","DOI":"10.1103\/PhysRevLett.70.2968","article-title":"Finite temperature error-correcting codes","volume":"70","author":"Ruj\u00e1n","year":"1993","journal-title":"Physical review letters"},{"issue":"9","key":"2026032712074039600_ref173","doi-asserted-by":"crossref","first-page":"4569","DOI":"10.1109\/TIT.2015.2449844","article-title":"On the dispersions of the Gel\u2019fand-Pinsker channel and dirty paper coding","volume":"61","author":"Scarlett","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref174","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1109\/TIT.2014.2310453","article-title":"Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations","volume":"60","author":"Scarlett","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"2026032712074039600_ref175","doi-asserted-by":"crossref","first-page":"3950","DOI":"10.1109\/TIT.2016.2555317","article-title":"Multiuser random coding techniques for mismatched decoding","volume":"62","author":"Scarlett","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref176","doi-asserted-by":"crossref","first-page":"2253","DOI":"10.1109\/TIT.2017.2781363","article-title":"Mismatched multi-letter successive decoding for the multiple -access channel","volume":"64","author":"Scarlett","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref177","doi-asserted-by":"crossref","first-page":"4449","DOI":"10.1109\/TIT.2014.2322033","article-title":"Expurgated random-coding ensembles: Exponents, refinements, and connections","volume":"60","author":"Scarlett","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2026032712074039600_ref178","doi-asserted-by":"crossref","first-page":"6700","DOI":"10.1109\/TIT.2015.2487340","article-title":"Second-order asymptotics for the Gaussian MAC with degraded message sets","volume":"61","author":"Scarlett","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2-3","key":"2026032712074039600_ref179","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1561\/0100000101","article-title":"Information-theoretic foundations of mismatched decoding","volume":"17","author":"Scarlett","year":"2020","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"key":"2026032712074039600_ref180","volume-title":"Reliable communication under mismatched decoding","author":"Scarlett","year":"2014"},{"key":"2026032712074039600_ref181","first-page":"461","article-title":"Estimating the dimension of a model","volume":"6","author":"Schwartz","year":"1978","journal-title":"Ann. Stat."},{"issue":"3","key":"2026032712074039600_ref182","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":"The Bell System Technical Journal"},{"issue":"1","key":"2026032712074039600_ref183","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0019-9958(67)90052-6","article-title":"Lower bounds to error probability for coding on discrete memoryless channels. i","volume":"10","author":"Shannon","year":"1967","journal-title":"Information and Control"},{"issue":"5","key":"2026032712074039600_ref184","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0019-9958(67)91200-4","article-title":"Lower bounds to error probability for coding on discrete memoryless channels. ii","volume":"10","author":"Shannon","year":"1967","journal-title":"Information and Control"},{"key":"2026032712074039600_ref185","first-page":"114","volume-title":"Error bound of hypothesis testing with data compression","author":"Shimokawa"},{"key":"2026032712074039600_ref186","volume-title":"Communication over an unknown channel via common broadcasting","author":"Shulman","year":"2003"},{"issue":"99","key":"2026032712074039600_ref187","doi-asserted-by":"crossref","first-page":"107","DOI":"10.2298\/PIM0999107S","article-title":"On a new converse of Jensen\u2019s inequality","volume":"85","author":"Simi\u0107","year":"2009","journal-title":"Publications de l\u2019Institut Math\u00e9matique"},{"issue":"1","key":"2026032712074039600_ref188","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","article-title":"On general minimax theorems","volume":"8","author":"Sion","year":"1958","journal-title":"Pacific Journal of Mathematics"},{"issue":"4","key":"2026032712074039600_ref189","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless coding of correlated information sources","volume":"19","author":"Slepian","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712074039600_ref190","doi-asserted-by":"crossref","first-page":"6444","DOI":"10.1109\/TIT.2011.2165826","article-title":"Exact random coding exponents for erasure decoding","volume":"57","author":"Somekh-Baruch","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712074039600_ref191","doi-asserted-by":"crossref","first-page":"3452","DOI":"10.1109\/TIT.2019.2902387","article-title":"Generalized random Gilbert-Varshamov codes","volume":"65","author":"Somekh-Baruch","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref192","doi-asserted-by":"crossref","first-page":"052","DOI":"10.1103\/PhysRevE.103.052121","article-title":"Optimal work extraction and mutual information in a generalized Szil\u00e1rd engine","volume":"103","author":"Song","year":"2021","journal-title":"Physical Review E."},{"issue":"10","key":"2026032712074039600_ref193","doi-asserted-by":"crossref","first-page":"6564","DOI":"10.1109\/TIT.2021.3091762","article-title":"Error exponents in the bee identification problem","volume":"67","author":"Tamir","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref194","doi-asserted-by":"crossref","first-page":"265","DOI":"10.3390\/e23030265","article-title":"Trade-offs between error exponents and excess-rate exponents of typical Slepian-Wolf codes","volume":"23","author":"Tamir","year":"2021","journal-title":"Entropy"},{"issue":"4","key":"2026032712074039600_ref195","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1109\/TIT.2021.3137057","article-title":"Universal decoding for the typical random code and for the expurgated code","volume":"68","author":"Tamir","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"2026032712074039600_ref196","doi-asserted-by":"crossref","first-page":"7479","DOI":"10.1109\/TIT.2023.3314210","article-title":"Error exponents of the dirty-paper and Gel\u2019fand-Pinsker channels","volume":"69","author":"Tamir","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2026032712074039600_ref197","doi-asserted-by":"crossref","first-page":"6635","DOI":"10.1109\/TIT.2020.2995136","article-title":"Large deviations behavior of the logarithmic error probability of random codes","volume":"66","author":"Tamir","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-2","key":"2026032712074039600_ref198","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000086","article-title":"Asymptotic estimates in information theory with non-vanishing error probabilities","volume":"11","author":"Tan","year":"2014","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"2026032712074039600_ref199","first-page":"2077","volume-title":"The third-order term in the normal approximation for the AWGN channel","author":"Tan"},{"issue":"11","key":"2026032712074039600_ref200","doi-asserted-by":"crossref","first-page":"7405","DOI":"10.1109\/TCOMM.2019.2935204","article-title":"The bee-identification problem: Bounds on the error exponent","volume":"67","author":"Tandon","year":"2019","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712074039600_ref201","volume-title":"General Theory of Functions and Integration","author":"Taylor","year":"1985"},{"issue":"10","key":"2026032712074039600_ref202","doi-asserted-by":"crossref","first-page":"4508","DOI":"10.1109\/TIT.2009.2027484","article-title":"Communication under strong asynchronism","volume":"55","author":"Tchamkerten","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712074039600_ref203","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1109\/TIT.2012.2227238","article-title":"Asynchronous communication: Capacity bounds and suboptimality of training","volume":"59","author":"Tchamkerten","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref204","article-title":"The method of types for the AWGN channel","volume-title":"arXiv preprint","author":"Tridenski","year":"2023"},{"issue":"12","key":"2026032712074039600_ref205","doi-asserted-by":"crossref","first-page":"7499","DOI":"10.1109\/TIT.2023.3312326","article-title":"Concentration properties of random codes","volume":"69","author":"Truong","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref206","article-title":"Generalized random Gilbert-Varshamov codes: Typical error exponent and concentration properties","volume-title":"IEEE Trans. Inf. Theory","author":"Truong","year":"2023"},{"key":"2026032712074039600_ref207","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of Wireless Communication","author":"Tse","year":"2005"},{"issue":"5","key":"2026032712074039600_ref208","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1109\/TIT.2009.2016057","article-title":"Capacity\/storage tradeoff in high-dimensional identification systems","volume":"55","author":"Tuncel","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712074039600_ref209","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TIT.1982.1056454","article-title":"Channel coding with multilevel\/phase signals","volume":"28","author":"Ungerboeck","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref210","volume-title":"On the Wagner-Anantharam outer bound and achievable Gaussian source coding exponents","author":"Vamvatsikos","year":"2007"},{"key":"2026032712074039600_ref211","first-page":"2306","volume-title":"Saddlepoint approximation of the error probability of binary hypothesis testing","author":"V\u00e1zquez-Vilar"},{"key":"2026032712074039600_ref212","volume-title":"Principles of Digital Communication and Coding","author":"Viterbi","year":"2009"},{"key":"2026032712074039600_ref213","first-page":"1071","volume-title":"Error exponents in asynchronous communication","author":"Wang"},{"issue":"2","key":"2026032712074039600_ref214","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/18.312161","article-title":"Optimal sequential probability assignment for individual sequences","volume":"40","author":"Weinberger","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref215","doi-asserted-by":"crossref","first-page":"4940","DOI":"10.1109\/TIT.2019.2910065","article-title":"On the reliability function of distributed hypothesis testing under optimal detection","volume":"65","author":"Weinberger","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2026032712074039600_ref216","doi-asserted-by":"crossref","first-page":"5077","DOI":"10.1109\/TIT.2014.2335733","article-title":"Codeword or noise? Exact random coding exponents for joint detection and decoding","volume":"60","author":"Weinberger","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref217","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1109\/TIT.2015.2405537","article-title":"Optimum tradeoffs between the error exponent and the excess-rate exponent of variable-rate Slepian-Wolf coding","volume":"61","author":"Weinberger","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712074039600_ref218","doi-asserted-by":"crossref","first-page":"2533","DOI":"10.1109\/TIT.2016.2641954","article-title":"A large deviations approach to secure lossy compression","volume":"63","author":"Weinberger","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712074039600_ref219","doi-asserted-by":"crossref","first-page":"6364","DOI":"10.1109\/TIT.2017.2732356","article-title":"Channel detection in coded communication","volume":"63","author":"Weinberger","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"2026032712074039600_ref220","doi-asserted-by":"crossref","first-page":"4218","DOI":"10.1109\/TIT.2017.2689778","article-title":"Simplified erasure\/list decoding","volume":"63","author":"Weinberger","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712074039600_ref221","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1111\/j.2517-6161.1955.tb00197.x","article-title":"Some distributions and moment formulae for the Markov chain","volume":"17","author":"Whittle","year":"1955","journal-title":"J. Roy. Stat. Soc., B"},{"key":"2026032712074039600_ref222","first-page":"82","volume-title":"On the capacity of a biometrical identification system","author":"Willems"},{"key":"2026032712074039600_ref223","first-page":"90","article-title":"List decoding","volume":"48","author":"Wozencraft","year":"1958","journal-title":"Quarterly Progress Report"},{"key":"2026032712074039600_ref224","doi-asserted-by":"crossref","volume-title":"A reverse Jensen inequality result with application to mutual information estimation","author":"Wunder","DOI":"10.1109\/ITW48936.2021.9611449"},{"issue":"1","key":"2026032712074039600_ref225","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1976.1055508","article-title":"The rate-distortion function for source coding with side information at the decoder","volume":"22","author":"Wyner","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"2026032712074039600_ref226","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"},{"key":"2026032712074039600_ref227","first-page":"1287","volume-title":"A technique for deriving one-shot achievability results in network information theory","author":"Yassaee"},{"key":"2026032712074039600_ref228","first-page":"2309","volume-title":"Third-order analysis of channel coding in the small-to-moderate deviations regime","author":"Yavas"},{"key":"2026032712074039600_ref229","doi-asserted-by":"crossref","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"},{"key":"2026032712074039600_ref230","first-page":"100","volume-title":"A type covering lemma and the excess distortion exponent for coding memory-less Laplacian sources","author":"Zhong"},{"issue":"3","key":"2026032712074039600_ref231","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1109\/TIT.2008.2011436","article-title":"Joint source-channel coding excess distortion exponent for some memoryless continuous-alphabet systems","volume":"55","author":"Zhong","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712074039600_ref232","first-page":"2921","article-title":"Second-order and moderate deviations asymptotics for successive refinement","volume":"63","author":"Zhou","year":"2017","journal-title":"IEEE Trans. Inf. 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\/22\/1\/1\/11160702\/0100000142en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/22\/1\/1\/11160702\/0100000142en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:08:48Z","timestamp":1774627728000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/22\/1\/1\/1332828\/A-Toolbox-for-Refined-Information-Theoretic"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,30]]},"references-count":232,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1,30]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000142","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,30]]}}}