Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Claude E. Shannon
@article{DBLP:journals/aim/McCarthyMRS06, author = {John McCarthy and Marvin Minsky and Nathaniel Rochester and Claude E. Shannon}, title = {A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence, August 31, 1955}, journal = {{AI} Mag.}, volume = {27}, number = {4}, pages = {12--14}, year = {2006}, url = {https://doi.org/10.1609/aimag.v27i4.1904}, doi = {10.1609/AIMAG.V27I4.1904}, timestamp = {Tue, 25 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aim/McCarthyMRS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigmobile/Shannon01, author = {Claude E. Shannon}, title = {A mathematical theory of communication}, journal = {{ACM} {SIGMOBILE} Mob. Comput. Commun. Rev.}, volume = {5}, number = {1}, pages = {3--55}, year = {2001}, url = {https://doi.org/10.1145/584091.584093}, doi = {10.1145/584091.584093}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigmobile/Shannon01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pieee/Shannon98, author = {Claude E. Shannon}, title = {Communication In The Presence Of Noise}, journal = {Proc. {IEEE}}, volume = {86}, number = {2}, pages = {447--457}, year = {1998}, url = {https://doi.org/10.1109/jproc.1998.659497}, doi = {10.1109/JPROC.1998.659497}, timestamp = {Mon, 28 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pieee/Shannon98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jasis/Bar-HillelCCGKL74, author = {Yehoshua Bar{-}Hillel and R. Carnap and E. C. Cherry and Eugene Garfield and D. W. King and F. W. Lancaster and J. C. R. Licklider and D. M. Mackay and J. W. Perry and D. J. De S. Price and Gerard Salton and Claude E. Shannon and Mortimer Taube and B. C. Vickery and A. E. Cawkell}, title = {Where the Action Is and Was in Information Science}, journal = {J. Am. Soc. Inf. Sci.}, volume = {25}, number = {5}, pages = {340}, year = {1974}, url = {https://doi.org/10.1002/asi.4630250514}, doi = {10.1002/ASI.4630250514}, timestamp = {Wed, 13 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jasis/Bar-HillelCCGKL74.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ShannonGB67a, author = {Claude E. Shannon and Robert G. Gallager and Elwyn R. Berlekamp}, title = {Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. {I}}, journal = {Inf. Control.}, volume = {10}, number = {1}, pages = {65--103}, year = {1967}, url = {https://doi.org/10.1016/S0019-9958(67)90052-6}, doi = {10.1016/S0019-9958(67)90052-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ShannonGB67a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ShannonGB67b, author = {Claude E. Shannon and Robert G. Gallager and Elwyn R. Berlekamp}, title = {Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. {II}}, journal = {Inf. Control.}, volume = {10}, number = {5}, pages = {522--552}, year = {1967}, url = {https://doi.org/10.1016/S0019-9958(67)91200-4}, doi = {10.1016/S0019-9958(67)91200-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ShannonGB67b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Shannon58, author = {Claude E. Shannon}, title = {A Note on a Partial Ordering for Communication Channels}, journal = {Inf. Control.}, volume = {1}, number = {4}, pages = {390--397}, year = {1958}, url = {https://doi.org/10.1016/S0019-9958(58)90239-0}, doi = {10.1016/S0019-9958(58)90239-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Shannon58.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ibmrd/Shannon58, author = {Claude E. Shannon}, title = {Channels with Side Information at the Transmitter}, journal = {{IBM} J. Res. Dev.}, volume = {2}, number = {4}, pages = {289--293}, year = {1958}, url = {https://doi.org/10.1147/rd.24.0289}, doi = {10.1147/RD.24.0289}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ibmrd/Shannon58.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Shannon57, author = {Claude E. Shannon}, title = {Certain Results in Coding Theory for Noisy Channels}, journal = {Inf. Control.}, volume = {1}, number = {1}, pages = {6--25}, year = {1957}, url = {https://doi.org/10.1016/S0019-9958(57)90039-6}, doi = {10.1016/S0019-9958(57)90039-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Shannon57.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Shannon56, author = {Claude E. Shannon}, title = {The zero error capacity of a noisy channel}, journal = {{IRE} Trans. Inf. Theory}, volume = {2}, number = {3}, pages = {8--19}, year = {1956}, url = {https://doi.org/10.1109/TIT.1956.1056798}, doi = {10.1109/TIT.1956.1056798}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Shannon56.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/EliasFS56, author = {Peter Elias and Amiel Feinstein and Claude E. Shannon}, title = {A note on the maximum flow through a network}, journal = {{IRE} Trans. Inf. Theory}, volume = {2}, number = {4}, pages = {117--119}, year = {1956}, url = {https://doi.org/10.1109/TIT.1956.1056816}, doi = {10.1109/TIT.1956.1056816}, timestamp = {Mon, 03 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/EliasFS56.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Shannon53, author = {Claude E. Shannon}, title = {Communication theory - Exposition of fundamentals}, journal = {Trans. {IRE} Prof. Group Inf. Theory}, volume = {1}, pages = {44--47}, year = {1953}, url = {https://doi.org/10.1109/TIT.1953.1188568}, doi = {10.1109/TIT.1953.1188568}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Shannon53.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Shannon53a, author = {Claude E. Shannon}, title = {General treatment of the problem of coding}, journal = {Trans. {IRE} Prof. Group Inf. Theory}, volume = {1}, pages = {102--104}, year = {1953}, url = {https://doi.org/10.1109/TIT.1953.1188559}, doi = {10.1109/TIT.1953.1188559}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Shannon53a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Shannon53b, author = {Claude E. Shannon}, title = {The lattice theory of information}, journal = {Trans. {IRE} Prof. Group Inf. Theory}, volume = {1}, pages = {105--107}, year = {1953}, url = {https://doi.org/10.1109/TIT.1953.1188572}, doi = {10.1109/TIT.1953.1188572}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Shannon53b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Shannon53c, author = {Claude E. Shannon}, title = {Discussion on Dr. Shannon's papers}, journal = {Trans. {IRE} Prof. Group Inf. Theory}, volume = {1}, pages = {169--174}, year = {1953}, url = {https://doi.org/10.1109/TIT.1953.1188581}, doi = {10.1109/TIT.1953.1188581}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Shannon53c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bstj/Shannon49, author = {Claude E. Shannon}, title = {The synthesis of two-terminal switching circuits}, journal = {Bell Syst. Tech. J.}, volume = {28}, number = {1}, pages = {59--98}, year = {1949}, url = {https://doi.org/10.1002/j.1538-7305.1949.tb03624.x}, doi = {10.1002/J.1538-7305.1949.TB03624.X}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bstj/Shannon49.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bstj/Shannon49a, author = {Claude E. Shannon}, title = {Communication theory of secrecy systems}, journal = {Bell Syst. Tech. J.}, volume = {28}, number = {4}, pages = {656--715}, year = {1949}, url = {https://doi.org/10.1002/j.1538-7305.1949.tb00928.x}, doi = {10.1002/J.1538-7305.1949.TB00928.X}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bstj/Shannon49a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bstj/Shannon48, author = {Claude E. Shannon}, title = {A mathematical theory of communication}, journal = {Bell Syst. Tech. J.}, volume = {27}, number = {3}, pages = {379--423}, year = {1948}, url = {https://doi.org/10.1002/j.1538-7305.1948.tb01338.x}, doi = {10.1002/J.1538-7305.1948.TB01338.X}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bstj/Shannon48.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bstj/Shannon48a, author = {Claude E. Shannon}, title = {A mathematical theory of communication}, journal = {Bell Syst. Tech. J.}, volume = {27}, number = {4}, pages = {623--656}, year = {1948}, url = {https://doi.org/10.1002/j.1538-7305.1948.tb00917.x}, doi = {10.1002/J.1538-7305.1948.TB00917.X}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bstj/Shannon48a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.