Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Claude E. Shannon

dblp:s/ClaudeEShannon · also Claude Elwood Shannon · DBLP profile ↗
← Back
12ranked-venue papers
10as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 9 first-authorDatabases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
10 papers
Coding theory · 74% Information theory · 26% Computational complexity · 1%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 21 heaviest of 22, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.031998
Communication In The Presence Of Noise · Proc. IEEE 1998
The zero error capacity of a noisy channel · IRE Trans. Inf. Theory 1956
Certain Results in Coding Theory for Noisy Channels · Inf. Control. 1957
Coding theory
channel coding
0.021998
Communication In The Presence Of Noise · Proc. IEEE 1998
General treatment of the problem of coding · Trans. IRE Prof. Group Inf. Theory 1953
Coding theory
source coding
0.021998
Communication In The Presence Of Noise · Proc. IEEE 1998
General treatment of the problem of coding · Trans. IRE Prof. Group Inf. Theory 1953
Coding theory › source coding
lossless compression
0.011998
Communication In The Presence Of Noise · Proc. IEEE 1998
Physical-layer communications
modulation
0.011998
Communication In The Presence Of Noise · Proc. IEEE 1998
Information theory › communication channels › channel models
discrete memoryless channel
0.021967
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II · Inf. Control. 1967
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I · Inf. Control. 1967
Coding theory › channel coding
error exponent
0.021967
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II · Inf. Control. 1967
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I · Inf. Control. 1967
Computational complexity
lower bounds
0.021967
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II · Inf. Control. 1967
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I · Inf. Control. 1967
Information theory
communication channels
0.011958
A Note on a Partial Ordering for Communication Channels · Inf. Control. 1958
Coding theory
error-correcting codes
0.011957
Certain Results in Coding Theory for Noisy Channels · Inf. Control. 1957
Information theory › channel capacity
feedback capacity
0.021956
The zero error capacity of a noisy channel · IRE Trans. Inf. Theory 1956
The lattice theory of information · Trans. IRE Prof. Group Inf. Theory 1953
Graph algorithms and graph theory › minimum cut
max-flow min-cut
0.011956
A note on the maximum flow through a network · IRE Trans. Inf. Theory 1956
Graph algorithms and graph theory › graph algorithms › network flow
maximum flow
0.011956
A note on the maximum flow through a network · IRE Trans. Inf. Theory 1956
Graph algorithms and graph theory › graph algorithms
network flow
0.011956
A note on the maximum flow through a network · IRE Trans. Inf. Theory 1956
Information theory › communication channels › channel models
noisy channel
0.021957
Certain Results in Coding Theory for Noisy Channels · Inf. Control. 1957
The zero error capacity of a noisy channel · IRE Trans. Inf. Theory 1956
Combinatorics and discrete mathematics
partial orders
0.011958
A Note on a Partial Ordering for Communication Channels · Inf. Control. 1958
Information theory › channel capacity
zero-error capacity
0.011956
The zero error capacity of a noisy channel · IRE Trans. Inf. Theory 1956
Information theory › information measures
entropy
0.011953
Communication theory - Exposition of fundamentals · Trans. IRE Prof. Group Inf. Theory 1953
Information theory
information measures
0.011953
Communication theory - Exposition of fundamentals · Trans. IRE Prof. Group Inf. Theory 1953
Information theory › channel capacity
information rate
0.011953
General treatment of the problem of coding · Trans. IRE Prof. Group Inf. Theory 1953
Information theory
network information theory
0.011953
The lattice theory of information · Trans. IRE Prof. Group Inf. Theory 1953

Methods — techniques the papers use, named apart from their topics

geometric signal space representation · 0.0upper and lower bound derivation · 0.0stochastic process modeling · 0.0lattice-theoretic formulation · 0.0exposition · 0.0
YearPublicationVenuePosition
1998 Communication In The Presence Of Noise
abstract
A method is developed for representing any communication system geometrically. Messages and the corresponding signals are points in two function spaces, and the modulation process is a mapping of one space into the other. Using this representation, a number of results in communication theory are deduced concerning expansion and compression of bandwidth and the threshold effect. Formulas are found for the maximum rate of transmission of binary digits over a system when the signal is perturbed by various types of noise. Some of the properties of ideal systems which transmit at this maximum rate are discussed The equivalent number of binary digits per second for certain information sources is calculated.
Claude E. Shannon
Proc. IEEE1
1974 Where the Action Is and Was in Information Science
Yehoshua Bar-Hillel, R. Carnap, E. C. Cherry, Eugene Garfield, D. W. King, F. W. Lancaster, J. C. R. Licklider, D. M. Mackay, J. W. Perry, D. J. De S. Price, Gerard Salton, Claude E. Shannon, Mortimer Taube, B. C. Vickery, Anthony E. Cawkell
J. Am. Soc. Inf. Sci.12
1967 Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I
Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp
Inf. Control.1
1967 Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II
Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp
Inf. Control.1
1958 A Note on a Partial Ordering for Communication Channels
Claude E. Shannon
Inf. Control.1
1957 Certain Results in Coding Theory for Noisy Channels
Claude E. Shannon
Inf. Control.1
1956 A note on the maximum flow through a network
abstract
This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of a number of branches, each of which has a limited capacity. The main result is a theorem: The maximum possible flow from left to right through a network is equal to the minimum value among all simple cut-sets. This theorem is applied to solve a more general problem, in which a number of input nodes and a number of output nodes are used.
Peter Elias 0001, Amiel Feinstein, Claude E. Shannon
IRE Trans. Inf. Theory3
1956 The zero error capacity of a noisy channel
abstract
The zero error capacityC_oof a noisy channel is defined as the least upper bound of rates at which it is possible to transmit information with zero probability of error. Various properties ofC_oare studied; upper and lower bounds and methods of evaluation ofC_oare given. Inequalities are obtained for theC_orelating to the "sum" and "product" of two given channels. The analogous problem of zero error capacityC_oFfor a channel with a feedback link is considered. It is shown that while the ordinary capacity of a memoryless channel with feedback is equal to that of the same channel without feedback, the zero error capacity may be greater. A solution is given to the problem of evaluatingC_oF.
Claude E. Shannon
IRE Trans. Inf. Theory1
1953 Communication theory - Exposition of fundamentals
abstract
In any branch of applied mathematics, the vague and ambiguous concepts of a physical problem are given a more refined and idealized meaning. In information theory, one of the basic notions is that of the amount of information associated with a given situation. Information here, although related to the everyday of the word, should not be confused with it. In everyday usage, information usually implies something about the semantic content of a message. For the purposes of communication theory, the meaning of a message is generally irrelevant; what is significant is the difficulty in transmitting the message from one point to another.
Claude E. Shannon
Trans. IRE Prof. Group Inf. Theory1
1953 General treatment of the problem of coding
abstract
A typical communication system consists of the following five elements: (1) An information source. This can be considered to be represented mathematically by a suitable stochastic process which chooses one message from a set of possible messages. The rate R of producing information is measured by the entropy per symbol of the process. (2) An encoding or transmitting element. Mathematically this amounts to a transformation applied to the message to produce the signal, i.e., the encoded message. (3) A channel on which the signal is transmitted from transmitter to receiver. During transmission the signal may be perturbed by noise. (4) A receiving and decoding (or demodulating) device which recovers the original message from the received signal. (5) The destination of the information, e.g., the human ear (for telephony) or the eye (for television). The characteristics of the destination may determine the significant elements of the information to be transmitted. For example, with sound transmission, precise recovery of the phases of components is not required because of the insensitivity of the ear to this type of distortion.
Claude E. Shannon
Trans. IRE Prof. Group Inf. Theory1
1953 The lattice theory of information
abstract
The word "information" has been given many different meanings by various writers in the general field of information theory. It is likely that at least a number of these will prove sufficiently useful in certain applications to deserve further study and permanent recognition. It is hardly to be expected that a single concept of information would satisfactorily account for the numerous possible applications of this general field. The present note outlines a new approach to information theory which is aimed specifically at the analysis of certain communication problems in which there exist a number of information sources simultaneously in operation. A typical example is that of a simple communication channel with a feedback path from the receiving point to the transmitting point. The problem is to make use of the feedback information for improving forward transmission, and to determine the forward channel capacity when the best possible use is made of this feedback information. Another more general problem is that of a communication system consisting of a large number of transmitting and receiving points with some type of interconnection network between the various points. The problem here is to formulate the best systems design whereby, in some sense, the best overall use of the available facilities is made. While the analysis sketched here has not yet proceeded to the point or a complete solution of these problems, partial answers have been found and it is believed that a complete solution may be possible.
Claude E. Shannon
Trans. IRE Prof. Group Inf. Theory1
1953 Discussion on Dr. Shannon's papers
Claude E. Shannon
Trans. IRE Prof. Group Inf. Theory1