default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaude E. Shannon
Person information
- award (1966): IEEE Medal of Honor
- award (1966): National Medal of Science
- award: National Inventors Hall of Fame
- award: Kyoto Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2006
[j19]John McCarthy, Marvin Minsky, Nathaniel Rochester, Claude E. Shannon:
A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence, August 31, 1955. AI Mag. 27(4): 12-14 (2006)- 2001
- [j18]Claude E. Shannon:
A mathematical theory of communication. ACM SIGMOBILE Mob. Comput. Commun. Rev. 5(1): 3-55 (2001) - 1998
- [j17]Claude E. Shannon:
Communication In The Presence Of Noise. Proc. IEEE 86(2): 447-457 (1998) - 1974
- [j16]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, A. E. Cawkell:
Where the Action Is and Was in Information Science. J. Am. Soc. Inf. Sci. 25(5): 340 (1974) - 1967
- [j15]Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp:
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I. Inf. Control. 10(1): 65-103 (1967) - [j14]Claude E. Shannon, Robert G. Gallager, Elwyn R. Berlekamp:
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II. Inf. Control. 10(5): 522-552 (1967) - 1958
- [j13]Claude E. Shannon:
A Note on a Partial Ordering for Communication Channels. Inf. Control. 1(4): 390-397 (1958) - [j12]Claude E. Shannon:
Channels with Side Information at the Transmitter. IBM J. Res. Dev. 2(4): 289-293 (1958) - 1957
- [j11]Claude E. Shannon:
Certain Results in Coding Theory for Noisy Channels. Inf. Control. 1(1): 6-25 (1957) - 1956
- [j10]Claude E. Shannon:
The zero error capacity of a noisy channel. IRE Trans. Inf. Theory 2(3): 8-19 (1956) - [j9]Peter Elias, Amiel Feinstein, Claude E. Shannon:
A note on the maximum flow through a network. IRE Trans. Inf. Theory 2(4): 117-119 (1956) - 1953
- [j8]Claude E. Shannon:
Communication theory - Exposition of fundamentals. Trans. IRE Prof. Group Inf. Theory 1: 44-47 (1953) - [j7]Claude E. Shannon:
General treatment of the problem of coding. Trans. IRE Prof. Group Inf. Theory 1: 102-104 (1953) - [j6]Claude E. Shannon:
The lattice theory of information. Trans. IRE Prof. Group Inf. Theory 1: 105-107 (1953) - [j5]Claude E. Shannon:
Discussion on Dr. Shannon's papers. Trans. IRE Prof. Group Inf. Theory 1: 169-174 (1953) - 1949
- [j4]Claude E. Shannon:
The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28(1): 59-98 (1949) - [j3]Claude E. Shannon:
Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4): 656-715 (1949) - 1948
- [j2]Claude E. Shannon:
A mathematical theory of communication. Bell Syst. Tech. J. 27(3): 379-423 (1948) - [j1]Claude E. Shannon:
A mathematical theory of communication. Bell Syst. Tech. J. 27(4): 623-656 (1948)
Conference and Workshop Papers
- 2024
- [c1]Vincent W. S. Chan, Claude E. Shannon:
Orchestrated Routing for Optical Satellite Networks. ICTON 2024: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
