János Körner

János Körner is a Hungarian mathematician who works on information theory and combinatorics.[1]

Körner studied Mathematics at the Eötvös Loránd University in Budapest with a degree in 1970[2] and was then at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences until 1992. From 1981 to 1983 he was at the Bell Laboratories and in 1987–88 at Télécom Paris (ENST) in Paris.[2] He has been a professor at the Sapienza University of Rome since 1993.[1]

Over his career, he frequently collaborated with fellow information theorists such as Rudolf Ahlswede, Katalin Marton, and Imre Csiszár. Together with Rudolf Ahlswede and Peter Gács he proved the blowing-up lemma.[3] Besides information theory, he also works on extremal graph theory.

In 2014 he received the Claude E. Shannon Award.[2] He served as Associated editor of the IEEE Transactions on Information Theory on multiple occasions. He is a member of the Hungarian Academy of Sciences.[1]

Books
  • With Imre Csiszár: Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press 1981, 2nd edition Cambridge University Press 2011.
gollark: I really should get LDAP working properly.
gollark: I run on entirely Linux, and somehow entirely *Arch* Linux.
gollark: Loud rack servers instead of... also loud tower servers, VMs instead of containers, Windows instead of Linux, bizarrely convoluted nested reverse proxies for some reason, old PHP/ASP applications instead of my shinier Node/Python ones, sort of thing.
gollark: I have a friend who's also into the whole servers-at-home thing, but made basically opposite technical decisions to me.
gollark: VMs do seem to be a major source of RAM wastage.

References
  1. "Biography from IEEE".
  2. "János Körner". Information Theory Society. Retrieved 2020-06-12.
  3. Ahlswede, Gacs, Körner Bounds on conditional probabilities with applications in multiuser communication, Z. Wahrsch. und Verw. Gebiete 34, 1976, 157–177
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.