On information rates for mismatched decoders

DOI10.1109/18.340469zbMath0826.94017OpenAlexW2154433856MaRDI QIDQ4850296

Neri Merhav, Gideon Kaplan, Amos Lapidoth, Shlomo Shamai

Publication date: 29 November 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/42a2d21000717ce7285221a3fa586831222da897

zbMATH Keywords

exponential familiesrandom codingsphere packinggeneralized mutual informationmismatched decodinggeneralized cutoff rate

Mathematics Subject Classification ID

Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items (3)

On the Relation Between Encoding and Decoding of Neuronal Spikes ⋮ A Causal Perspective on the Analysis of Signal and Noise Correlations and Their Role in Population Coding ⋮ Tight Data-Robust Bounds to Mutual Information Combining Shuffling and Model Selection Techniques

This page was built for publication: On information rates for mismatched decoders