The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Nested linear/lattice codes for structured multiterminal binning
Abstract
Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning scheme. Wyner (1974, 1978) and other researchers proposed various forms of coset codes for efficient binning, yet these schemes were applicable only for lossless source (or noiseless channel) network coding. To extend the algebraic binning approach to lossy source (or noisy channel) network coding, previous work proposed the idea of nested codes, or more specifically, nested parity-check codes for the binary case and nested lattices in the continuous case. These ideas connect network information theory with the rich areas of linear codes and lattice codes, and have strong potential for practical applications. We review these developments and explore their tight relation to concepts such as combined shaping and precoding, coding for memories with defects, and digital watermarking. We also propose a few novel applications adhering to a unified approach.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
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
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
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
The rate-distortion function for source coding with side information at the decoder
Wyner, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055508 · Cited by 3,023
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Self-citationChen, B., & Wornell, G. W. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923725 · Cited by 2,095
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
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
Self-citationCover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7 · Cited by 1,532
CODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
Sum Capacity of Gaussian Vector Broadcast Channels
Yu, W., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833336 · Cited by 742
Channels with Side Information at the Transmitter
Shannon, C. E. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.24.0289 · Cited by 657
Recent results in the Shannon theory
Wyner, A. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055171 · Cited by 633
A coding theorem for the discrete memoryless broadcast channel
Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056046 · Cited by 607
Berger, T. (1978) · Medical Entomology and Zoology · Cited by 552
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
Enhancing the cellular downlink capacity via co-processing at the transmitting end
Shamai, S., & Zaidel, B. M. (2002) · IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202) · doi:10.1109/vetecs.2001.944993 · Cited by 461
Self-citationZamir, R., & Feder, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.508838 · Cited by 333
Self-citationVoronoi regions of lattices, second moments of polytopes, and quantization
Conway, J., & Sloane, N. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056483 · Cited by 321
A survey of multi-way channels in information theory: 1961-1976
van der Meulen, E. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055652 · Cited by 292
Systematic lossy source/channel coding
Shamai, S., Verdu, S., & Zamir, R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661505 · Cited by 256
Self-citationOn universal quantization by randomized uniform/lattice quantizers
Zamir, R., & Feder, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119699 · Cited by 221
Self-citationRate-distortion for correlated sources with partially separated encoders
Kaspi, A., & Berger, T. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056586 · Cited by 127
Lattice codes can achieve capacity on the AWGN channel
Urbanke, R. L., & Rimoldi, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651040 · Cited by 119
Multiterminal source coding with high resolution
Zamir, R., & Berger, T. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746775 · Cited by 119
Self-citationOn the duality between distributed source coding and data hiding
Chou, J. C., Pradhan, S. S., & Ramchandran, K. (2003) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.1999.832000 · Cited by 89
Generalized Decision-Feedback Equalization for Packet Transmission with ISI and Gaussian Noise
Cioffi, J. M., & Forney, G. D. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6281-8_4 · Cited by 89
A Survey of Multi-Way Channels in Information Theory:
Meulen, D. (1977) · Cited by 43
Signaling for the Gaussian channel with side information at the transmitter
Willems, F. M. J. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2000.866646 · Cited by 19
Barron, R. J., Chen, B., & Wornell, G. W. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2001.936163 · Cited by 19
Tradeoff between message and state information rates
Sutivong, A., Cover, T. M., & Chiang, M. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2001.936166 · Cited by 15
Cited by
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Self-citationPeel, C. B., Hochwald, B. M., & Swindlehurst, A. L. (2005) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.840638 · Cited by 1,721
Digital Watermarking and Steganography
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-372585-1.x5001-3 · Cited by 1,656
Girod, B., Aaron, A. M., Rane, S., & Rebollo-Monedero, D. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.839619 · Cited by 1,246
Gesbert, D., Kountouris, M., Heath, R. W., Chae, C.-B., & Salzer, T. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.904815 · Cited by 1,083
Metadata
- Authors
- Zamir, R., Shamai, S., & Erez, U.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2002-06
- Volume
- 48
- Issue
- 6
- Pages
- 1250-1276
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2111992817
- Cited by
- 876
- References
- 41
- FWCI
- 51.50
- 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.