The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem
Abstract
We determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture requires higher rates to send a Gaussian source than it does to send any other source with the same covariance. Our techniques can also be used to determine the sum-rate of some generalizations of this classical problem. Our approach involves coupling the problem to a quadratic Gaussian ldquoCEO problem.rdquo
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
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
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Berger, T. (1978) · Medical Entomology and Zoology · Cited by 552
Probability and Random Processes with Applications to Signal Processing
Stark, H., & Woods, J. (2001) · Medical Entomology and Zoology · Cited by 508
The CEO problem [multiterminal source coding]
Berger, T., Zhang, Z., & Viswanathan, H. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.490552 · Cited by 489
Multiterminal source coding with high resolution
Zamir, R., & Berger, T. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746775 · Cited by 131
The Wyner–Ziv Problem With Multiple Sources
Gastpar, M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836707 · Cited by 107
An improved outer bound for multiterminal source coding
Wagner, A. B., & Anantharam, V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920249 · Cited by 93
Self-citation
Cited by
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Broadband Analog Aggregation for Low-Latency Federated Edge Learning
Zhu, G., Wang, Y., & Huang, K. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2946245 · Cited by 761
Hybrid Beamforming for Massive MIMO Over-the-Air Computation
Zhai, X., Chen, X., Xu, J., & Kwan Ng, D. W. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3051397 · Cited by 74
Metadata
- Authors
- Wagner, A. B., Tavildar, S., & Viswanath, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-05
- Volume
- 54
- Issue
- 5
- Pages
- 1938-1961
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2172236196
- Cited by
- 299
- References
- 16
- FWCI
- 49.64
- 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.