{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:45:43Z","timestamp":1778496343302,"version":"3.51.4"},"reference-count":112,"publisher":"Emerald","issue":"2-3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>Shannon's channel coding theorem characterizes the maximal rate of information that can be reliably transmitted over a communication channel when optimal encoding and decoding strategies are used. In many scenarios, however, practical considerations such as channel uncertainty and implementation constraints rule out the use of an optimal decoder. The mismatched decoding problem addresses such scenarios by considering the case that the decoder cannot be optimized, but is instead fixed as part of the problem statement. This problem is not only of direct interest in its own right, but also has close connections with other long-standing theoretical problems in information theory.<\/jats:p>\n                  <jats:p>In this monograph, we survey both classical literature and recent developments on the mismatched decoding problem, with an emphasis on achievable random-coding rates for memoryless channels. We present two widely-considered achievable rates known as the generalized mutual information (GMI) and the LM rate, and overview their derivations and properties. In addition, we survey several improved rates via multi-user coding techniques, as well as recent developments and challenges in establishing upper bounds on the mismatch capacity, and an analogous mismatched encoding problem in rate-distortion theory. Throughout the monograph, we highlight a variety of applications and connections with other prominent information theory problems.<\/jats:p>","DOI":"10.1561\/0100000101","type":"journal-article","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T08:54:27Z","timestamp":1592556867000},"page":"149-401","source":"Crossref","is-referenced-by-count":42,"title":["Information-Theoretic Foundations of Mismatched Decoding"],"prefix":"10.1108","volume":"17","author":[{"given":"Jonathan","family":"Scarlett","sequence":"first","affiliation":[{"name":"National University of Singapore ,","place":["Singapore"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Guill\u00e9n i F\u00e0bregas","sequence":"additional","affiliation":[{"name":"ICREA, Universitat Pompeu Fabra , , and University of Cambridge, UK","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anelia","family":"Somekh-Baruch","sequence":"additional","affiliation":[{"name":"Bar-Ilan University ,","place":["Israel"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfonso","family":"Martinez","sequence":"additional","affiliation":[{"name":"Universitat Pompeu Fabra ,","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"2026032712175219900_ref001","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 Sys. Tech. Journal"},{"issue":"2","key":"2026032712175219900_ref002","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1109\/JLT.2017.2786351","article-title":"Achievable information rates for fiber optics: Applications and computations","volume":"36","author":"Alvarado","year":"2018","journal-title":"J. Lightwave Tech."},{"issue":"7","key":"2026032712175219900_ref003","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":"5","key":"2026032712175219900_ref004","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1109\/18.995552","article-title":"Fading channels: How perfect need \u2018perfect side information\u2019 be?","volume":"48","author":"Lapidoth","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref005","first-page":"61","article-title":"Coding for two noisy channels","author":"Elias","year":"1955","journal-title":"London Symp. Inf. Theory"},{"key":"2026032712175219900_ref006","volume-title":"Information Theory and Reliable Communication","author":"Gallager","year":"1968"},{"issue":"1","key":"2026032712175219900_ref007","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/18.370120","article-title":"Channel capacity for a given decoding metric","volume":"45","author":"Csisz\u00e1r","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712175219900_ref008","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":"5","key":"2026032712175219900_ref009","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1109\/18.532892","article-title":"Nearest neighbor decoding for additive nonGaussian noise channels","volume":"42","author":"Lapidoth","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref010","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807213","volume-title":"Fundamentals of Wireless Communication","author":"Tse","year":"2005"},{"issue":"8","key":"2026032712175219900_ref011","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1109\/TIT.2004.831744","article-title":"Gaussian codes and weighted nearest neighbor decoding in fading multiple-antenna channels","volume":"50","author":"Weingarten","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1-2","key":"2026032712175219900_ref012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000019","article-title":"Bit-interleaved coded modulation","volume":"5","author":"Guill\u00e9n i F\u00e0bregas","year":"2008","journal-title":"Found. Trends Comms. Inf. Theory"},{"issue":"6","key":"2026032712175219900_ref013","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1109\/TIT.2009.2018177","article-title":"Bit-interleaved coded modulation revisited: A mismatched decoding perspective","volume":"55","author":"Martinez","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"2026032712175219900_ref014","doi-asserted-by":"crossref","first-page":"1636","DOI":"10.1109\/26.803498","article-title":"Integer metrics for binary input symmetric output memoryless channels","volume":"47","author":"Binshtok","year":"1999","journal-title":"IEEE Trans. Comms."},{"issue":"234","key":"2026032712175219900_ref015","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/26.380049","article-title":"Decoding under integer metrics constraints","volume":"43","author":"Salz","year":"1995","journal-title":"IEEE Trans. Comms."},{"issue":"4","key":"2026032712175219900_ref016","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/JLT.2016.2620721","article-title":"Scope and limitations of the nonlinear Shannon limit","volume":"35","author":"Secondini","year":"2017","journal-title":"J. Lightwave Tech."},{"issue":"4","key":"2026032712175219900_ref017","doi-asserted-by":"crossref","first-page":"2376","DOI":"10.1109\/TIT.2017.2662698","article-title":"Models and information rates for Wiener phase noise channels","volume":"63","author":"Ghozlan","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712175219900_ref018","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/18.481778","article-title":"Erasure, list, and detection zero-error capacities for low noise and a relation to identification","volume":"42","author":"Ahlswede","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712175219900_ref019","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1109\/18.720537","article-title":"Zero-error information theory","volume":"44","author":"K\u00f6rner","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712175219900_ref020","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inf. Theory"},{"issue":"6","key":"2026032712175219900_ref021","doi-asserted-by":"crossref","first-page":"2148","DOI":"10.1109\/18.720535","article-title":"Reliable communication under channel uncertainty","volume":"44","author":"Lapidoth","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref022","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"2011","edition":"2nd ed."},{"key":"2026032712175219900_ref023","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139030687","volume-title":"Network Information Theory","author":"El Gamal","year":"2011"},{"key":"2026032712175219900_ref024","first-page":"419","volume-title":"IEEE Inf. Theory Workshop","author":"Feldman","year":"2016"},{"issue":"4","key":"2026032712175219900_ref025","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1214\/aoms\/1177706106","article-title":"The capacity of a class of channels","volume":"30","author":"Blackwell","year":"1959","journal-title":"Ann. Math. Stats."},{"issue":"3","key":"2026032712175219900_ref026","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1214\/aoms\/1177705783","article-title":"The capacities of certain channel classes under random coding","volume":"31","author":"Blackwell","year":"1960","journal-title":"Ann. Math. Stats."},{"issue":"2","key":"2026032712175219900_ref027","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/18.2627","article-title":"The capacity of the arbitrarily varying channel revisited: Positivity, constraints","volume":"34","author":"Csiszar","year":"1988","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712175219900_ref028","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/TIT.1966.1053861","article-title":"Coding for a class of unknown channels","volume":"12","author":"Stiglitz","year":"1966","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref029","unstructured":"R.\n              Gallager\n            \n          , \u201cFixed composition arguments and lower bounds to error probability,\u201d 1992, [Online]. Available:http:\/\/web.mit.edu\/gallager\/www\/notes\/notes5.pdf."},{"key":"2026032712175219900_ref030","volume-title":"Elements of Information Theory","author":"Cover","year":"2006"},{"key":"2026032712175219900_ref031","volume-title":"PhD Thesis","author":"Hui","year":"1983"},{"issue":"1","key":"2026032712175219900_ref032","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":"2026032712175219900_ref033","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"Boyd","year":"2004"},{"issue":"1","key":"2026032712175219900_ref034","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":"2026032712175219900_ref035","first-page":"211","article-title":"Some remarks on the role of inaccuracy in Shannon's theory of information transmission","volume-title":"Trans. 8th Prague Conf. Inf. Theory","author":"Fischer","year":"1971"},{"issue":"5","key":"2026032712175219900_ref036","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1109\/18.532884","article-title":"Mismatched decoding and the multiple-access channel","volume":"42","author":"Lapidoth","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref037","volume-title":"Reliable communication under mismatched decoding","author":"Scarlett","year":"2014"},{"issue":"7","key":"2026032712175219900_ref038","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1109\/18.887846","article-title":"Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit","volume":"46","author":"Ganti","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712175219900_ref039","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1109\/18.476314","article-title":"A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels","volume":"41","author":"Balakirsky","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref040","volume-title":"PhD Thesis","author":"Telatar","year":"1992"},{"issue":"7","key":"2026032712175219900_ref041","doi-asserted-by":"crossref","first-page":"3825","DOI":"10.1109\/TIT.2014.2322624","article-title":"The zero-undetected-error capacity approaches the Sperner capacity","volume":"60","author":"Bunte","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712175219900_ref042","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","article-title":"Channel coding rate in the finite blocklength regime","volume":"56","author":"Polyanskiy","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712175219900_ref043","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":"4","key":"2026032712175219900_ref044","first-page":"228","article-title":"Information rates and error exponents of compound channels with application to antipodal signaling in a fading environment","volume":"47","author":"Kaplan","year":"1993","journal-title":"Arch. Elek. \u00dcber."},{"key":"2026032712175219900_ref045","first-page":"1","volume-title":"Inf. Theory and Apps. Workshop","author":"Scarlett","year":"2013"},{"issue":"6","key":"2026032712175219900_ref046","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1109\/TIT.2002.1003841","article-title":"Source coding, large deviations, and approximate pattern matching","volume":"48","author":"Dembo","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712175219900_ref047","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/TIT.2016.2620161","article-title":"The dispersion of nearest-neighbor decoding for additive non-Gaussian channels","volume":"63","author":"Scarlett","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712175219900_ref048","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/18.567644","article-title":"On the role of mismatch in rate distortion theory","volume":"43","author":"Lapidoth","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712175219900_ref049","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0019-9958(69)90403-3","article-title":"The rate distortion function for a class of sources","volume":"15","author":"Sakrison","year":"1969","journal-title":"Information and Control"},{"issue":"1","key":"2026032712175219900_ref050","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/TIT.1970.1054394","article-title":"The rate of a class of random processes","volume":"16","author":"Sakrison","year":"1970","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2026032712175219900_ref051","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1109\/18.650987","article-title":"On the performance of data compression algorithms based upon string matching","volume":"44","author":"Yang","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref052","first-page":"1","article-title":"The additive noise channel with a helper","author":"Bross","year":"2019","journal-title":"IEEE Inf. Theory Workshop"},{"issue":"4","key":"2026032712175219900_ref053","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/18.761253","article-title":"On the redundancy of lossy source coding with abstract alphabets","volume":"45","author":"Yang","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712175219900_ref054","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1002\/j.1538-7305.1959.tb03905.x","article-title":"Probability of error for optimal codes in a gaussian channel","volume":"38","author":"Shannon","year":"1959","journal-title":"Bell Sys. Tech. Journal"},{"issue":"5","key":"2026032712175219900_ref055","doi-asserted-by":"crossref","first-page":"3145","DOI":"10.1109\/TIT.2018.2886959","article-title":"Refined asymptotics for rate-distortion using Gaussian codebooks for arbitrary sources","volume":"65","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"2026032712175219900_ref056","doi-asserted-by":"crossref","first-page":"3309","DOI":"10.1109\/TIT.2012.2186786","article-title":"Fixed-length lossy compression in the finite blocklength regime","volume":"58","author":"Kostina","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712175219900_ref057","doi-asserted-by":"crossref","first-page":"1922","DOI":"10.1109\/TIT.2006.872845","article-title":"Mismatched codebooks and the role of entropy coding in lossy data compression","volume":"52","author":"Kontoyiannis","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712175219900_ref058","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1109\/18.256495","article-title":"An algorithm for source coding subject to a fidelity criterion, based on string matching","volume":"39","author":"Steinberg","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712175219900_ref059","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/18.490546","article-title":"An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results","volume":"42","author":"Zhang","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"2026032712175219900_ref060","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/TIT.2003.810637","article-title":"Mismatch in high-rate entropyconstrained vector quantization","volume":"49","author":"Gray","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2026032712175219900_ref061","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TCOM.1975.1092819","article-title":"Quantizer mismatch","volume":"23","author":"Gray","year":"1975","journal-title":"IEEE Trans. Comms."},{"issue":"7","key":"2026032712175219900_ref062","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"},{"key":"2026032712175219900_ref063","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 Math"},{"issue":"2","key":"2026032712175219900_ref064","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/TIT.2014.2385699","article-title":"On achievable rates and error exponents for channels with mismatched decoding","volume":"61","author":"Somekh-Baruch","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"2026032712175219900_ref065","doi-asserted-by":"crossref","first-page":"5387","DOI":"10.1109\/TIT.2015.2468719","article-title":"A counter-example to the mismatched decoding converse for binary-input discrete memoryless channels","volume":"61","author":"Scarlett","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref066","volume-title":"PhD Thesis","author":"Shulman","year":"2003"},{"issue":"8","key":"2026032712175219900_ref067","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":"6","key":"2026032712175219900_ref068","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"},{"issue":"12","key":"2026032712175219900_ref069","doi-asserted-by":"crossref","first-page":"3029","DOI":"10.1109\/TIT.2002.805064","article-title":"Variations on the Gallager bounds, connections, and applications","volume":"48","author":"Shamai","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712175219900_ref070","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1002\/j.1538-7305.1952.tb01393.x","article-title":"A comparison of signalling alphabets","volume":"31","author":"Gilbert","year":"1952","journal-title":"Bell Labs Tech. J."},{"issue":"5","key":"2026032712175219900_ref071","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"Varshamov","year":"1957","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"9","key":"2026032712175219900_ref072","doi-asserted-by":"crossref","first-page":"4554","DOI":"10.1109\/TIT.2015.2449856","article-title":"A general formula for the mismatch capacity","volume":"61","author":"Somekh-Baruch","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref073","first-page":"531","article-title":"Multi-letter converse bounds for the mismatched discrete memoryless channel with an additive metric","author":"Somekh-Baruch","year":"2015","journal-title":"IEEE Int. Symp. Inf. Theory"},{"key":"2026032712175219900_ref074","unstructured":"E.\n              Asadi Kangarshahi\n             and A.Guill\u00e9n i F\u00e0bregas, \u201cA singleletter upper bound to the mismatch capacity,\u201d 2020, [Online]. Available:https:\/\/arxiv.org\/abs\/2004.01785."},{"issue":"9","key":"2026032712175219900_ref075","doi-asserted-by":"crossref","first-page":"6196","DOI":"10.1109\/TIT.2018.2837892","article-title":"Converse theorems for the DMC with mismatched decoding","volume":"64","author":"Somekh-Baruch","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref076","volume-title":"Information-Spectrum Methods in Information Theory","author":"Han","year":"2002"},{"issue":"4","key":"2026032712175219900_ref077","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1109\/18.335960","article-title":"A general formula for channel capacity","volume":"40","author":"Verd\u00fa","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref078","first-page":"526","article-title":"On mismatched list decoding","author":"Somekh-Baruch","year":"2015","journal-title":"IEEE Int. Symp. Inf. Theory"},{"key":"2026032712175219900_ref079","first-page":"23","article-title":"Multi-way communication channels","author":"Ahlswede","year":"1973","journal-title":"IEEE Int. Symp. Inf. Theory"},{"issue":"2","key":"2026032712175219900_ref080","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TIT.2008.2009807","article-title":"Capacity bounds for the Gaussian interference channel","volume":"55","author":"Motahari","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref081","first-page":"2873","article-title":"An upper bound to the mismatch capacity","author":"Asadi Kangarshahi","year":"2019","journal-title":"IEEE Int. Symp. Inf. Theory"},{"key":"2026032712175219900_ref082","first-page":"115","article-title":"Properties of a recent upper bound to the mismatch capacity","author":"Asadi Kangarshahi","year":"2019","journal-title":"in Int. Z\u00fcrich Sem. Inf. Comm."},{"key":"2026032712175219900_ref083","volume-title":"Performance of mismatched receivers on bandlimited channels, PhD Thesis","author":"Divsalar","year":"1978"},{"key":"2026032712175219900_ref084","first-page":"37","article-title":"Upper and lower bounds for noisy channel coding under mismatch","volume-title":"Proc. Conf. Info. Sci. Sys","author":"Kazakos","year":"1981"},{"issue":"5","key":"2026032712175219900_ref085","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1109\/TCOM.1982.1095544","article-title":"Coded error probability evaluation for antijam communication systems","volume":"30","author":"Omura","year":"1982","journal-title":"IEEE Trans. Comms."},{"key":"2026032712175219900_ref086","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/EEEI.2000.924387","article-title":"On the capacity of reducedcomplexity receivers for intersymbol interference channels","author":"Abou-Faycal","year":"2000","journal-title":"IEEE Conv. Elec. Eng. in Israel"},{"issue":"3","key":"2026032712175219900_ref087","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/TIT.2011.2173707","article-title":"Bounds on the information rate of intersymbol interference channels based on mismatched receivers","volume":"58","author":"Rusek","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712175219900_ref088","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TIT.2008.2009581","article-title":"Optimization of information rate upper and lower bounds for channels with memory","volume":"55","author":"Sadeghi","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712175219900_ref089","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1109\/TWC.2011.121911.110809","article-title":"Optimal channel shortening for MIMO and ISI channels","volume":"11","author":"Rusek","year":"2012","journal-title":"IEEE Trans. Wireless Comms."},{"issue":"11","key":"2026032712175219900_ref090","doi-asserted-by":"crossref","first-page":"7166","DOI":"10.1109\/TIT.2014.2357016","article-title":"MIMO block-fading channels with mismatched CSI","volume":"60","author":"Asyhari","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2026032712175219900_ref091","doi-asserted-by":"crossref","first-page":"1483","DOI":"10.1109\/TIT.2011.2173719","article-title":"Nearest neighbor decoding in MIMO block-fading channels with imperfect CSIR","volume":"58","author":"Asyhari","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"2026032712175219900_ref092","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TCOMM.2011.121211.110222","article-title":"A general framework for transmission with transceiver distortion and some applications","volume":"60","author":"Zhang","year":"2012","journal-title":"IEEE Trans. Comms."},{"key":"2026032712175219900_ref093","first-page":"170","article-title":"Fixed-energy random coding with rescaled codewords at the transmitter","author":"Fehr","year":"2016","journal-title":"in Int. Z\u00fcrich Sem. Comms."},{"issue":"1-2","key":"2026032712175219900_ref094","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":"Found. Trends Comms. Inf. Theory"},{"key":"2026032712175219900_ref095","first-page":"2899","article-title":"Random-coding bounds for threshold decoders: Error exponent and saddlepoint approximation","author":"Martinez","year":"2011","journal-title":"IEEE Int. Symp. Inf. Theory"},{"key":"2026032712175219900_ref096","first-page":"1","article-title":"Saddlepoint approximation of random-coding bounds","author":"Martinez","year":"2011","journal-title":"Inf. Theory Apps. Workshop"},{"key":"2026032712175219900_ref097","first-page":"1500","article-title":"Second-order asymptotics of universal JSCC for arbitrary sources and additive channels","author":"Zhou","year":"2018","journal-title":"IEEE Int. Symp. Inf. Theory"},{"key":"2026032712175219900_ref098","first-page":"1","article-title":"A note on feedback communication with mismatched decoding","volume-title":"IEEE Int. Conf. Sci. Elec. Eng","author":"Lapidoth","year":"2016"},{"key":"2026032712175219900_ref099","first-page":"1838","article-title":"The zero-undetected-error capacity of discrete memoryless channels with feedback","volume-title":"Allerton Conf. Comm., Control, and Comp","author":"Bunte","year":"2012"},{"key":"2026032712175219900_ref100","first-page":"2751","article-title":"Mismatched identification via channels","author":"Somekh-Baruch","year":"2017","journal-title":"IEEE Int. Symp. Inf. Theory"},{"issue":"1","key":"2026032712175219900_ref101","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/18.42172","article-title":"Identification via channels","volume":"35","author":"Ahlswede","year":"1989","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2026032712175219900_ref102","doi-asserted-by":"crossref","unstructured":"M. H.\n              Yassaee\n            , M. R.Aref, and A.Gohari, \u201cA technique for deriving one-shot achievability results in network information theory,\u201d 2013, [Online]. Available:http:\/\/arxiv.org\/abs\/1303.0696.","DOI":"10.1109\/ISIT.2013.6620434"},{"key":"2026032712175219900_ref103","first-page":"86","article-title":"The likelihood decoder: Error exponents and mismatch","author":"Scarlett","year":"2015","journal-title":"IEEE Int. Symp. Inf. Theory"},{"issue":"8","key":"2026032712175219900_ref104","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":"2026032712175219900_ref105","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":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2026032712175219900_ref106","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":"3","key":"2026032712175219900_ref107","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/PROC.1973.9030","article-title":"The Viterbi algorithm","volume":"61","author":"Forney","year":"1973","journal-title":"Proc. IEEE"},{"issue":"6","key":"2026032712175219900_ref108","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1002\/ett.4460090602","article-title":"A lower bound on the bit-errorrate resulting from mismatched Viterbi decoding","volume":"9","author":"Lapidoth","year":"1998","journal-title":"European Trans. Telecom."},{"key":"2026032712175219900_ref109","first-page":"1","article-title":"A lower bound on achievable rates by polar codes with mismatch polar decoding","author":"Alsan","year":"2013","journal-title":"IEEE Inf. Theory Workshop"},{"key":"2026032712175219900_ref110","first-page":"750","article-title":"Performance of mismatched polar codes over BSCs","author":"Alsan","year":"2012","journal-title":"Int. Symp. Inf. Theory Apps"},{"key":"2026032712175219900_ref111","first-page":"366","article-title":"Polarization as a novel architecture to boost the classical mismatched capacity of B-DMCs","author":"Alsan","year":"2014","journal-title":"IEEE Inf. Theory Workshop"},{"key":"2026032712175219900_ref112","volume-title":"Integer Programming and Combinatorial Optimization","author":"Nemhauser","year":"1999"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/17\/2-3\/149\/11153379\/0100000101en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/17\/2-3\/149\/11153379\/0100000101en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:34Z","timestamp":1777471834000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/17\/2-3\/149\/1332363\/Information-Theoretic-Foundations-of-Mismatched"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,31]]},"references-count":112,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2020,8,31]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000101","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,31]]}}}