Claude E. Shannon Award
The Claude E. Shannon Award of the IEEE Information Theory Society was created to honor consistent and profound contributions to the field of information theory. Each Shannon Award winner is expected to present a Shannon Lecture at the following IEEE International Symposium on Information Theory.[1] It is a prestigious prize in information theory, covering technical contributions at the intersection of mathematics, communication engineering, and theoretical computer science.
Claude E. Shannon Award | |
---|---|
Awarded for | To honor consistent and profound contributions to the field of information theory. |
Sponsored by | IEEE Information Theory Society |
Country | USA |
Reward(s) | The award consists of a bronze medal, certificate, and honorarium. |
First awarded | 1974 |
Website | Claude E. Shannon Award |
It is named for Claude E. Shannon, who was also the first recipient.
Recipients
The following people have received the Claude E. Shannon Award:[2]
- 1972 – Claude E. Shannon
- 1974 – David S. Slepian
- 1976 – Robert M. Fano
- 1977 – Peter Elias
- 1978 – Mark Semenovich Pinsker
- 1979 – Jacob Wolfowitz
- 1981 – W. Wesley Peterson
- 1982 – Irving S. Reed
- 1983 – Robert G. Gallager
- 1985 – Solomon W. Golomb
- 1986 – William Lucas Root
- 1988 – James Massey
- 1990 – Thomas M. Cover
- 1991 – Andrew Viterbi
- 1993 – Elwyn Berlekamp
- 1994 – Aaron D. Wyner
- 1995 – George David Forney
- 1996 – Imre Csiszár
- 1997 – Jacob Ziv
- 1998 – Neil Sloane
- 1999 – Tadao Kasami
- 2000 – Thomas Kailath
- 2001 – Jack Keil Wolf
- 2002 – Toby Berger
- 2003 – Lloyd R. Welch
- 2004 – Robert McEliece
- 2005 – Richard Blahut
- 2006 – Rudolf Ahlswede
- 2007 – Sergio Verdú
- 2008 – Robert M. Gray
- 2009 – Jorma Rissanen
- 2010 – Te Sun Han
- 2011 – Shlomo Shamai (Shitz)
- 2012 – Abbas El Gamal[3]
- 2013 – Katalin Marton[4]
- 2014 – János Körner
- 2015 – Robert Calderbank
- 2016 – Alexander Holevo
- 2017 – David Tse[5]
- 2018 – Gottfried Ungerboeck
- 2019 – Erdal Arıkan
- 2020 – Charles Bennett
- 2021 – Alon Orlitsky[6]
gollark: Is this based on chars or bytes?
gollark: ```java public static String normaliseLabel( String label ) { if( label == null ) return null; int length = Math.min( 32, label.length() ); StringBuilder builder = new StringBuilder( length ); for( int i = 0; i < length; i++ ) { char c = label.charAt( i ); if( (c >= ' ' && c <= '~') || (c >= 161 && c <= 172) || (c >= 174 && c <= 255) ) { builder.append( c ); } else { builder.append( '?' ); } } return builder.toString();}```
gollark: It doesn't seem to be.
gollark: Also, what are the restrictions on them? I ask because I want to use this as an insane serial protocol.
gollark: <@237328509234708481> What is the max length of labels?
See also
References
- "Past ISITs". IEEE Information Theory Society. Retrieved January 18, 2017.
- "Claude E. Shannon Award Recipients". IEEE Information Theory Society. Retrieved September 5, 2018.
- Andrew Myers (August 9, 2011). "El Gamal Wins IEEE's Claude E. Shannon Award". The Dish. Stanford University. Retrieved August 13, 2011.
- "2013 Claude E. Shannon Award". IEEE Information Theory Society. July 9, 2012. Retrieved July 9, 2012.
- "2017 Claude E. Shannon Award". Stanford University. July 22, 2016. Retrieved October 13, 2016.
- "Alon Orlitsky Named 2021 Claude E. Shannon Award Winner". IEEE Information Theory Society. June 25, 2020. Retrieved June 26, 2020.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.