The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
To code, or not to code: lossy source-channel communication revisited
Open accessAbstract
What makes a source-channel communication system optimal? It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distribution, the distortion measure, the channel conditional distribution, and the channel input cost function. Closed-form necessary and sufficient expressions relating the above entities are given. This generalizes both the separation-based approach as well as the two well-known examples of optimal uncoded communication. The condition of probabilistic matching is extended to certain nonergodic and multiuser scenarios. This leads to a result on optimal single-source broadcast communication.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
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
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Information Theory and Reliable Communication
Gallager, R. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2945-6 · Cited by 1,204
The Theory of Information and Coding
McEliece, R. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606267 · Cited by 986
Rate Distortion Theory: A Mathematical Basis for Data Compression
Davisson, L. (1972) · IEEE Transactions on Communications · doi:10.1109/tcom.1972.1091311 · Cited by 895
Berger, T. (2003) · Wiley Encyclopedia of Telecommunications · doi:10.1002/0471219282.eot142 · Cited by 717
On the capacity of wireless networks: the relay case
Gastpar, M., & Vetterli, M. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019409 · Cited by 467
Self-citationTheoretical limitations on the transmission of data from analog sources
Goblick, T. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053821 · Cited by 398
Duality between source coding and channel coding and its extension to the side information case
Pradhan, S. S., Chou, J., & Ramchandran, K. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810622 · Cited by 237
The source-channel separation theorem revisited
Vembu, S., Verdu, S., & Steinberg, Y. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.370119 · Cited by 236
Berger, T. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056943 · Cited by 206
Gastpar, M., Rimoldi, B., & Vetterli, M. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2000.866534 · Cited by 86
Self-citation
Cited by
Transporting information and energy simultaneously
Varshney, L. R. (2008) · 2008 IEEE International Symposium on Information Theory · doi:10.1109/isit.2008.4595260 · Cited by 1,785
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Beyond Transmitting Bits: Context, Semantics, and Task-Oriented Communications
Gunduz, D., Qin, Z., Aguerri, I. E., Dhillon, H. S., Yang, Z., Yener, A., Wong, K. K., & Chae, C.-B. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3223408 · Cited by 776
Signal Reconstruction From Noisy Random Projections
Haupt, J., & Nowak, R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880031 · Cited by 608
Multiuser MIMO Achievable Rates With Downlink Training and Channel State Feedback
Caire, G., Jindal, N., Kobayashi, M., & Ravindran, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046225 · Cited by 537
Metadata
- Authors
- Gastpar, M., Rimoldi, B., & Vetterli, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-05
- Volume
- 49
- Issue
- 5
- Pages
- 1147-1158
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2148164553
- Cited by
- 550
- References
- 14
- FWCI
- 28.05
- Type
- journal article
- Language
- en
- Open access
- green
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.