The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Reliable communication under channel uncertainty
Abstract
In many communication situations, the transmitter and the receiver must be designed without a complete knowledge of the probability law governing the channel over which transmission takes place. Various models for such channels and their corresponding capacities are surveyed. Special emphasis is placed on the encoders and decoders which enable reliable communication over these channels.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Wireless Communications: Principles and Practice
Rappaport, T. S. (1996) · Cited by 17,370
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
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
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
Capacity of a Burst-Noise Channel
Gilbert, E. N. (1960) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1960.tb03959.x · Cited by 2,313
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
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
Finite-state Markov channel-a useful model for radio communication channels
Wang, H. S., & Moayeri, N. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.350282 · Cited by 1,647
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
On the Shannon capacity of a graph
Lovasz, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,624
The zero error capacity of a noisy channel
Shannon, C. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056798 · Cited by 1,468
Common randomness in information theory and cryptography. I. Secret sharing
Ahlswede, R., & Csiszar, I. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.243431 · Cited by 1,325
Estimates of error rates for codes on burst-noise channels
Elliott, E. O. (1963) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1963.tb00955.x · Cited by 1,321
Spread spectrum communications handbook
(1995) · Choice Reviews Online · doi:10.5860/choice.32-3356 · Cited by 1,209
Information theoretic considerations for cellular mobile radio
Ozarow, L. H., Shamai, S. S., & Wyner, A. D. (1994) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.293655 · Cited by 1,090
The minimum description length principle in coding and modeling
Barron, A., Rissanen, J., & Yu, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720554 · Cited by 1,019
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
CODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
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
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Shannon-theoretic approach to a Gaussian cellular multiple-access channel
Wyner, A. D. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340450 · Cited by 729
Information-Spectrum Methods in Information Theory
Han, T. S. (2003) · Stochastic Modelling and Applied Probability · doi:10.1007/978-3-662-12066-8 · Cited by 682
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
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
Berger, T. (1978) · Medical Entomology and Zoology · Cited by 552
On channel capacity per unit cost
Verdu, S. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57201 · Cited by 522
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
Merhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
On information rates for mismatched decoders
Merhav, N., Kaplan, G., Lapidoth, A., & Shamai Shitz, S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340469 · Cited by 409
Self-citationCoding Theorems of Information Theory
Wolfowitz, J. (1978) · Springer eBooks · doi:10.1007/978-3-642-66822-7 · Cited by 391
Liao, H. H.-J. (1972) · Cited by 391
Lower bounds to error probability for coding on discrete memoryless channels. II
Shannon, C. E., Gallager, R. G., & Berlekamp, E. R. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91200-4 · Cited by 384
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
The Capacity of a Class of Channels
Blackwell, D., Breiman, L., & Thomasian, A. J. (1959) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706106 · Cited by 330
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels. II
Shamai, S., & Wyner, A. D. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.641554 · Cited by 288
The coding of messages subject to chance errors
Wolfowitz, J. (1957) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255380682 · Cited by 162
Berger, T., & Gibson, J. D. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720552 · Cited by 152
Wolfowitz, J. (1959) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00281397 · Cited by 135
The random coding bound is tight for the average code (Corresp.)
Gallager, R. G. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054971 · Cited by 104
Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels
Blackwell, D., Breiman, L., & Thomasian, A. J. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706452 · Cited by 91
On the capacity region of the discrete additive multiple-access arbitrarily varying channel
Gubner, J. A. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144713 · Cited by 11
Cited by
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
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Ephraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
Information-theoretic analysis of information hiding
Moulin, P., & O'Sullivan, J. A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.808134 · Cited by 673
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
Metadata
- Authors
- Lapidoth, A., & Narayan, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 6
- Pages
- 2148-2177
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2138129780
- Cited by
- 519
- References
- 46
- FWCI
- 9.07
- 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.