The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
On information rates for mismatched decoders
Abstract
Reliable transmission over a discrete-time memoryless channel with a decoding metric that is not necessarily matched to the channel (mismatched decoding) is considered. It is assumed that the encoder knows both the true channel and the decoding metric. The lower bound on the highest achievable rate found by Csiszar and Korner (1981) and by Hui (1983) for DMC's, hereafter denoted C/sub LM/, is shown to bear some interesting information-theoretic meanings. The bound C/sub LM/ turns out to be the highest achievable rate in the random coding sense, namely, the random coding capacity for mismatched decoding. It is also demonstrated that the /spl epsiv/-capacity associated with mismatched decoding cannot exceed C/sub LM/. New bounds and some properties of C/sub LM/ are established and used to find relations to the generalized mutual information and to the generalized cutoff rate. The expression for C/sub LM/ is extended to a certain class of memoryless channels with continuous input and output alphabets, and is used to calculate C/sub LM/ explicitly for several examples of theoretical and practical interest. Finally, it is demonstrated that in contrast to the classical matched decoding case, here, under the mismatched decoding regime, the highest achievable rate depends on whether the performance criterion is the bit error rate or the message error probability and whether the coding strategy is deterministic or randomized.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Lehmann, E. L. (1983) · Springer eBooks · doi:10.1007/978-1-4757-2769-2 · Cited by 1,356
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
Probability of Error for Optimal Codes in a Gaussian Channel
Shannon, C. E. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb03905.x · Cited by 807
Coding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
Generalized cutoff rates and Renyi's information measures
Csiszár, I. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370121 · Cited by 348
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch10 · Cited by 172
Decoding with approximate channel statistics for bandlimited nonlinear satellite channels
Biederman, L., Omura, J. K., & Jain, P. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056429 · Cited by 24
Wyner, A. D. (1973) · SIAM Journal on Applied Mathematics · doi:10.1137/0124031 · Cited by 17
Cited by
How much training is needed in multiple-antenna wireless links?
Hassibi, B., & Hochwald, B. M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.809594 · Cited by 2,312
Fading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
Bit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
Joint Spatial Division and Multiplexing—The Large-Scale Array Regime
Adhikary, A., Nam, J., Ahn, J.-Y., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2269476 · Cited by 1,317
Reliable communication under channel uncertainty
Lapidoth, A., & Narayan, P. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720535 · Cited by 519
Self-citation
Metadata
- Authors
- Merhav, N., Kaplan, G., Lapidoth, A., & Shamai Shitz, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1994
- Volume
- 40
- Issue
- 6
- Pages
- 1953-1967
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2154433856
- Cited by
- 409
- References
- 12
- FWCI
- 6.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.