The DOI matches its Crossref record; 199 of the 199 references it cites were found in a registry or an index.
Fifty years of Shannon theory
Abstract
A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication.
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
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Wyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
Communication in the presence of noise
Shannon, C. E. (1949) · Proceedings of the IRE · doi:10.1109/jrproc.1949.232969 · Cited by 6,539
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
Mathematical Analysis of Random Noise
Rice, S. O. (1944) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1944.tb00874.x · Cited by 5,480
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
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
Габор, Д. (1946) · Journal of the IEE · Cited by 5,036
Extrapolation, Interpolation, and Smoothing of Stationary Time Series: With Engineering Applications
Wiener, N. (1949) · The MIT Press eBooks · doi:10.7551/mitpress/2946.001.0001 · Cited by 4,826
Communication In The Presence Of Noise
Shannon, C. E. (1998) · Proceedings of the IEEE · doi:10.1109/jproc.1998.659497 · Cited by 4,804
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
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
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
Broadcast channels with confidential messages
Csiszar, I., & Korner, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055892 · Cited by 3,332
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
Certain Topics in Telegraph Transmission Theory
Nyquist, H. (1928) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1928.5055024 · Cited by 3,089
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
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
Three models for the description of language
Chomsky, N. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056813 · Cited by 2,796
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
An Introduction to Symbolic Dynamics and Coding
Lind, D., & Marcus, B. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108899727 · Cited by 2,696
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
Methods of Information Geometry
Amari, S.-I., & Nagaoka, H. (2007) · Translations of Mathematical Monographs · doi:10.1090/mmono/191 · Cited by 2,204
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
Three approaches to the quantitative definition of information*
Kolmogorov, A. N. (1968) · International Journal of Computer Mathematics · doi:10.1080/00207166808803030 · Cited by 2,031
Secret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
Statistical Methods for Speech Recognition
Sun, D. X., & Jelinek, F. (1999) · Journal of the American Statistical Association · doi:10.2307/2670189 · Cited by 1,946
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
Toeplitz Forms and Their Applications
Grenander, U., Szegö, G., & Kac, M. (1958) · Physics Today · doi:10.1063/1.3062237 · Cited by 1,840
Hartley, R. V. L. (1928) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1928.tb01236.x · Cited by 1,828
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
The Shannon sampling theorem—Its various extensions and applications: A tutorial review
Jerri, A. J. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10771 · Cited by 1,749
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
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
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
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
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
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
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
Universal codeword sets and representations of the integers
Elias, P. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055349 · Cited by 1,165
Note on the Consistency of the Maximum Likelihood Estimate
Wald, A. (1949) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729952 · Cited by 1,100
Information Theory and Coding.
Good, I. J., & Abramson, N. (1964) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343598 · Cited by 1,068
Some complexity questions related to distributive computing(Preliminary Report)
Yao, A. C.-C. (1979) · Proceedings of the eleventh annual ACM symposium on Theory of computing - STOC '79 · doi:10.1145/800135.804414 · Cited by 1,042
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
A symbolic analysis of relay and switching circuits
Shannon, C. E. (1938) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1938.5057767 · Cited by 1,012
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
Run-length encodings (Corresp.)
Golomb, S. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053907 · Cited by 988
Algorithmic Information Theory
Chaitin, G. J. (1977) · IBM Journal of Research and Development · doi:10.1147/rd.214.0350 · Cited by 982
The context-tree weighting method: basic properties
Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382012 · Cited by 919
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321495.321506 · Cited by 918
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913
E.Sullivan, L. (2009) · Sage eBooks · doi:10.4135/9781412972024.n2551 · Cited by 907
Universal coding, information, prediction, and estimation
Rissanen, J. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056936 · Cited by 898
Design of multiple description scalar quantizers
Vaishampayan, V. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256491 · Cited by 862
Landau, H. J., & Pollak, H. O. (1962) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1962.tb03279.x · Cited by 839 · cited 1×
“Wyner in [157] using the fundamental results of [158].”
BackgroundAn algorithm for computing the capacity of arbitrary discrete memoryless channels
Arimoto, S. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054753 · Cited by 838
XVIII.—On the Functions which are represented by the Expansions of the Interpolation-Theory
Whittaker, E. T. (1915) · Proceedings of the Royal Society of Edinburgh · doi:10.1017/s0370164600017806 · Cited by 823
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
Landauer, R. (1991) · Physics Today · doi:10.1063/1.881299 · Cited by 804
Csiszar, I. (1991) · The Annals of Statistics · doi:10.1214/aos/1176348385 · Cited by 790
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
Self-citationInformation and information stability of random variables and processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90319-9 · Cited by 758
Rissanen, J., & Langdon, G. G. (1979) · IBM Journal of Research and Development · doi:10.1147/rd.232.0149 · Cited by 751
Information theoretic inequalities
Dembo, A., Cover, T. M., & Thomas, J. A. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.104312 · Cited by 742
Information Theory and Statistics
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch11 · Cited by 729
Some inequalities satisfied by the quantities of information of Fisher and Shannon
Stam, A. J. (1959) · Information and Control · doi:10.1016/s0019-9958(59)90348-1 · Cited by 706
A simple derivation of the coding theorem and some applications
Gallager, R. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053730 · Cited by 687
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
Could information theory provide an ecological theory of sensory processing?
Atick, J. J. (2011) · Network: Computation in Neural Systems · doi:10.3109/0954898x.2011.638888 · Cited by 679
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (1993) · Springer eBooks · doi:10.1007/978-1-4757-3860-5 · Cited by 638
Recent results in the Shannon theory
Wyner, A. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055171 · Cited by 633
A universal data compression system
Rissanen, J. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056741 · Cited by 631
The capacity of the Gaussian interference channel under strong interference (Corresp.)
Sato, H. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056416 · Cited by 623
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
Modulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
Logical basis for information theory and probability theory
Kolmogorov, A. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054210 · Cited by 592
Hayes, S., Grebogi, C., & Ott, E. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.3031 · Cited by 573
Information-theoretic determination of minimax rates of convergence
Yang, Y., & Barron, A. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939142 · Cited by 555
Variations on a theme by Huffman
Gallager, R. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055959 · Cited by 546
Introduction to Shannon Sampling and Interpolation Theory
Marks, R. J. (1991) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4613-9708-3 · Cited by 538
Fano, R. M., & Wintringham, W. T. (1961) · Physics Today · doi:10.1063/1.3057290 · Cited by 536
The performance of universal encoding
Krichevsky, R., & Trofimov, V. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056331 · Cited by 535
A case where interference does not reduce capacity (Corresp.)
Carleial, A. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055432 · Cited by 533
Slepian, D. (1976) · Proceedings of the IEEE · doi:10.1109/proc.1976.10110 · Cited by 533
On the asymptotic eigenvalue distribution of Toeplitz matrices
Gray, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054924 · Cited by 526
A locally adaptive data compression scheme
Bentley, J. L., Sleator, D. D., Tarjan, R. E., & Wei, V. K. (1986) · Communications of the ACM · doi:10.1145/5684.5688 · Cited by 523
On channel capacity per unit cost
Verdu, S. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57201 · Cited by 522
Self-citationReliable communication under channel uncertainty
Lapidoth, A., & Narayan, P. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720535 · Cited by 519
Generalized Kraft Inequality and Arithmetic Coding
Rissanen, J. J. (1976) · IBM Journal of Research and Development · doi:10.1147/rd.203.0198 · Cited by 510
Cover, T. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054929 · Cited by 504
A Course in Density Estimation.
Jones, M. C., & Devroye, L. (1988) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982771 · Cited by 503
The information capacity of amplitude- and variance-constrained sclar gaussian channels
Smith, J. G. (1971) · Information and Control · doi:10.1016/s0019-9958(71)90346-9 · Cited by 497
Fading Channels: InformationTheoretic and Communications Aspects
(2009) · Information Theory · doi:10.1109/9780470544907.ch22 · Cited by 494
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
Theory of statistical inference and information
Vajda, I. (1989) · Medical Entomology and Zoology · Cited by 463
Algorithmic Information Theory
Chaitin, G. J. (1987) · Cambridge University Press eBooks · doi:10.1017/cbo9780511608858 · Cited by 461
Merhav, N., & Feder, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720534 · Cited by 438
Data compression and harmonic analysis
Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720544 · Cited by 432
The Basic Theorems of Information Theory
McMillan, B. (1953) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729028 · Cited by 424
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
Multiple access channels with arbitrarily correlated sources
Cover, T., Gamal, A. E., & Salehi, M. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056273 · Cited by 400
Approximation and estimation bounds for artificial neural networks
Barron, A. R. (1994) · Machine Learning · doi:10.1007/bf00993164 · Cited by 399
Theoretical 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
On the Shannon theory of information transmission in the case of continuous signals
Kolmogorov, A. (1956) · IRE Transactions on Information Theory · doi:10.1109/tit.1956.1056823 · Cited by 394
Gray, R. M. (2011) · Entropy and Information Theory · doi:10.1007/978-1-4419-7970-4_14 · Cited by 392
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
Information and Information Stability of Random Variables and Processes.
Brillinger, D. R., Pinsker, M. S., & Feinstein, A. (1964) · Applied Statistics · doi:10.2307/2985711 · Cited by 378
Bennett, C. H., & Shor, P. W. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720553 · Cited by 370
Davisson, L. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055092 · Cited by 365
Feinstein, A., & Fano, R. M. (1962) · Journal of the American Statistical Association · doi:10.2307/2281659 · Cited by 360
Entropy and the Central Limit Theorem
Barron, A. R. (1986) · The Annals of Probability · doi:10.1214/aop/1176992632 · Cited by 359
Information Theory for Continuous Systems
Ihara, S. (1993) · WORLD SCIENTIFIC eBooks · doi:10.1142/1676 · Cited by 358
Variable-Length Binary Encodings
Gilbert, E. N., & Moore, E. F. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb01583.x · Cited by 354
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
Some lower bounds on signal parameter estimation
Ziv, J., & Zakai, M. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054301 · Cited by 344
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
Ahlswede, R., & Dueck, G. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42172 · Cited by 316
A symbolic analysis of relay and switching circuits
Shannon, C. E. (1938) · Electrical Engineering · doi:10.1109/ee.1938.6431064 · Cited by 316
Anantharam, V., & Verdu, S. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481773 · Cited by 290
Self-citationEntropy and data compression schemes
Ornstein, D. S., & Weiss, B. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.179344 · Cited by 281
Oliver, B. M., Pierce, J. R., & Shannon, C. E. (1948) · Proceedings of the IRE · doi:10.1109/jrproc.1948.231941 · Cited by 273
Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration
Marton, K. (1996) · The Annals of Probability · doi:10.1214/aop/1039639365 · Cited by 261
Costa, M., & Gamal, A. E. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057340 · Cited by 257
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-citationKontoyiannis, I., Algoet, P. H., Suhov, Y. M., & Wyner, A. J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669425 · Cited by 251
Korner, J., & Orlitsky, A. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720537 · Cited by 247
A new basic theorem of information theory
Feinstein, A. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057459 · Cited by 245
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
Self-citationCould information theory provide an ecological theory of sensory processing?
Atick, J. J. (1992) · Network Computation in Neural Systems · doi:10.1088/0954-898x/3/2/009 · Cited by 234
A convergent gambling estimate of the entropy of English
Cover, T., & King, R. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055912 · Cited by 220
Bennett, C. H. (2018) · Feynman and Computation · doi:10.1201/9780429500459-13 · Cited by 218
Information theory and molecular biology
(1993) · Choice Reviews Online · doi:10.5860/choice.31-0924 · Cited by 216
Statistical inference under multiterminal data compression
Han, T. S., & Amari, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720540 · Cited by 215
Two inequalities implied by unique decipherability
McMillan, B. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056818 · Cited by 203
Berger, T., & Gibson, J. D. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720552 · Cited by 202
(1990) · Institute of Physics eBooks · doi:10.1887/0750307595 · Cited by 194
Hall, P., & Morton, S. C. (1993) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf00773669 · Cited by 193
Source coding algorithms for fast data compression
Pasco, R. C. (1976) · Cited by 191
The zero-error side information problem and chromatic numbers (Corresp.)
Witsenhausen, H. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055607 · Cited by 187
Multiple user information theory
El Gamal, A., & Cover, T. M. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11897 · Cited by 186
The Efficient Construction of an Unbiased Random Sequence
Elias, P. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692552 · Cited by 183
Coding theorems for individual sequences
Ziv, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055911 · Cited by 180
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch10 · Cited by 172
The coding of messages subject to chance errors
Wolfowitz, J. (1957) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255380682 · Cited by 162
Learning pattern classification-a survey
Kulkarni, S. R., Lugosi, G., & Venkatesh, S. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720536 · Cited by 161
A mapping approach to rate-distortion computation and analysis
Rose, K. H. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340468 · Cited by 140
Wolfowitz, J. (1959) · Archive for Rational Mechanics and Analysis · doi:10.1007/bf00281397 · Cited by 135
Rate-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
Information theory and molecular biology
Atkins, G. (1993) · FEBS Letters · doi:10.1016/0014-5793(93)81052-2 · Cited by 117
Certain Factors Affecting Telegraph Speed
Nyquist, H. (1924) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1924.5060996 · Cited by 117
Interval and recency rank source coding: Two on-line adaptive variable-length schemes
Eliaš, P. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057251 · Cited by 113
Linder, T., Lugosi, G., & Zeger, K. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340451 · Cited by 109
Estimating the information content of symbol sequences and efficient codes
Grassberger, P. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.30993 · Cited by 107
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Jacquet, P., & Szpankowski, W. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00298-w · Cited by 106
Fixed rate universal block source coding with a fidelity criterion
Neuhoff, D. L., Gray, R. M., & Davisson, L. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055439 · Cited by 104
Worst-case interactive communication. I. Two messages are almost optimal
Orlitsky, A. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57210 · Cited by 102
A strong version of the redundancy-capacity theorem of universal coding
Merhav, N., & Feder, M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382017 · Cited by 101
The early days of information theory
Pierce, J. R. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054955 · Cited by 100
A source matching approach to finding minimax codes
Davisson, L., & Leon‐Garcia, A. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056167 · Cited by 97
On variable-length-to-block coding
Jelinek, F., & Schneider, K. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054899 · Cited by 93
Kolmogorov's Contributions to Information Theory and Algorithmic Complexity
Cover, T. M., Gács, P., & Gray, R. M. (1989) · The Annals of Probability · doi:10.1214/aop/1176991250 · Cited by 91
Information inequalities and concentration of measure
Dembo, A. (1997) · The Annals of Probability · doi:10.1214/aop/1024404424 · Cited by 91
Coding of sources with unknown statistics--II: Distortion relative to a fidelity criterion
Ziv, J. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054831 · Cited by 88
Asymptotic properties of data compression and suffix trees
Szpankowski, W. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259648 · Cited by 75
The Capacity of the Band-Limited Gaussian Channel
Wyner, A. D. (1966) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1966.tb04214.x · Cited by 74
Some aspects of convexity useful in information theory
Witsenhausen, H. S. (1980) · IEEE Transactions on Information Theory · doi:10.1109/tit.1980.1056173 · Cited by 73
Image and Video Coding Standards
Aravind, R., Cash, G. L., Duttweiler, D. L., Hang, H., Haskell, B. G., & Puri, A. (1993) · AT&T Technical Journal · doi:10.1002/j.1538-7305.1993.tb00523.x · Cited by 71
Worst-case power-constrained noise for binary-input channels
Shamai, S. S., & Verdú, S. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.149501 · Cited by 71
Capacity of channels with uncoded side information
Shamai, S. S., & Verdú, S. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060514 · Cited by 70
Kreer, J. G. (1957) · IRE Transactions on Information Theory · doi:10.1109/tit.1957.1057418 · Cited by 70
A vector quantization approach to universal noiseless coding and quantization
Chou, P. A., Effros, M., & Gray, R. M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.508836 · Cited by 70
A survey of the theory of source coding with a fidelity criterion
Kieffer, J. C. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259634 · Cited by 69
The relation between information theory and the differential geometry approach to statistics
Campbell, L. L. (1985) · Information Sciences · doi:10.1016/0020-0255(85)90050-7 · Cited by 67
The art of signaling: fifty years of coding theory
Calderbank, A. R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720549 · Cited by 66
Zhang, Z., & Wei, V. K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.490546 · Cited by 57
A conversation with Claude Shannon
Ellersick, F. (1984) · IEEE Communications Magazine · doi:10.1109/mcom.1984.1091957 · Cited by 54
Information theory and the complexity of boolean functions
Pippenger, N. J. (1976) · Theory of Computing Systems · doi:10.1007/bf01683269 · Cited by 53
Universal data compression and repetition times
Willems, F. M. J. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42176 · Cited by 48
The rate of a class of random processes
Sakrison, D. (1970) · IEEE Transactions on Information Theory · doi:10.1109/tit.1970.1054394 · Cited by 47
Barron, A. R. (1999) · Oxford University Press eBooks · doi:10.1093/oso/9780198504856.003.0002 · Cited by 36
Information theory, complexity and neural networks
Abu‐Mostafa, Y. S. (1989) · IEEE Communications Magazine · doi:10.1109/35.41397 · Cited by 33
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
Kieffer, J. C., & Yang, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481775 · Cited by 28
Thirty Years of Vocoder Research
Dudley, H. (1964) · The Journal of the Acoustical Society of America · doi:10.1121/1.2143221 · Cited by 27
Todd, F. P., & Pratt, F. (1939) · The Journal of the American Military Institute · doi:10.2307/3038586 · Cited by 24
General treatment of the problem of coding
Shannon, C. E. (1953) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1953.1188559 · Cited by 19
Resource Letter ITP-1: Information Theory in Physics
Grandy, W. T. (1997) · American Journal of Physics · doi:10.1119/1.18776 · Cited by 15
Sensory Processing and Information Theory
Linsker, R. (1994) · Springer eBooks · doi:10.1007/978-94-011-1068-6_15 · Cited by 11
Cited by
Wamba-Taguimdje, S.-L., Fosso Wamba, S., Kala Kamdjoug, J. R., & Tchatchouang Wanko, C. E. (2020) · Business Process Management Journal · doi:10.1108/bpmj-10-2019-0411 · Cited by 1,280
Massive Access for 5G and Beyond
Chen, X., Ng, D. W. K., Yu, W., Larsson, E. G., Al-Dhahir, N., & Schober, R. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3019724 · Cited by 681
Distributed compression in a dense microsensor network
Pradhan, S. S., Kusuma, J., & Ramchandran, K. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985684 · Cited by 537
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Metadata
- Authors
- Verdu, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 6
- Pages
- 2057-2078
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2119173531
- Cited by
- 316
- References
- 199
- FWCI
- 7.77
- 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.