About the Information Theory Society
Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua. At vero eos et accusam et justo duo dolores et ea rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem ipsum dolor sit amet. Lorem ipsum dolor sit amet, consetetur sadipscing elitr. Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat, sed diam voluptua.
Get Involved
Attend A Conference
Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt.Meet It Society Students
Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt.Submit A Paper
Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam nonumy eirmod tempor invidunt.Upcoming Events

Hong Kong
[applications can now be submitted] 2025 Croucher Summer Course in Information Theory (CSCIT 2025)
2025 ½ÄÏÌåÓý Information Theory Workshop (ITW)
News
Shannon Award for 2026
The ½ÄÏÌåÓý Information Theory Society is pleased to announce that Frans Willems is the recipient of…
Recipients of the 2025 ½ÄÏÌåÓý Communication Society and Information Theory Society Joint Paper Award: Yifeng Xiong, Fan Liu, Yuanhao Cui, Weijie Yuan, Tony Xiao Han, and Giuseppe Caire
The Joint Paper Award recognizes outstanding papers that lie at the intersection of communications…
2025 Information Theory Society Paper Award Recipients Named
The winners of the 2025 ITSoc Paper Award were announced at the ISIT 2025 awards session.
2025 ITSoc Chapter of the Year Announced!
The Benelux Section Chapter has been named the 2025 Chapter of the Year.
Conferences
ISIT 2025 Mentoring and Outreach Event
The ISIT 2025 Mentoring and Outreach event will take place on Friday, June 27, from 13:00 to 14:20…
2025 Guangzhou, Hong Kong and Taipei Joint Workshop on Artificial Intelligence, Communications and Information Theory (AICIT2025)
The 2025 Guangzhou, Hong Kong and Taipei Joint Workshop on Artificial Intelligence, Communications…
Pre-announcement: 2025 Croucher Summer Course in Information Theory (CSCIT 2025)
Pre-announcement: 2025 Croucher Summer Course in Information Theory (CSCIT 2025)
…
Jobs
Postdoctoral Positions in the Information Theory, Probability and Statistics Unit
We seek two strong candidates with a PhD in IT or Mathematics to work at the intersection of…
Postdoctoral Fellow in Quantum Information Theory and Quantum Machine Learning
We are seeking a candidate with a PhD degree to work in the exciting and rapidly evolving field of…
Postdoc Positions in Communication, Quantum, Security, & ML
Arizona State University (ASU) and The University of Texas at Arlington (UTA) are looking for…
Call to Action
½ÄÏÌåÓý BITS the Information Theory Magazine
½ÄÏÌåÓý BITS the Information Theory Magazine publishes content that includes tutorials and review articles, historical surveys, and columns. The tutorial and review articles cover both traditional and emerging areas associated with Information Theory research and are written in a style accessible to readers outside the specialty of the article. The historical surveys are intended to highlight technological advances of current interest that have been significantly impacted by past Information Theory research.
Recent Journal Issues
½ÄÏÌåÓý Journal on Selected Areas in Information Theory
The ½ÄÏÌåÓý Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.
Research In Information Theory
This paper presents a comprehensive framework for holographic multiantenna communication, a paradigm that integrates both wide apertures and closely spaced antennas relative to the wavelength. The presented framework is physically grounded, enabling information-theoretic analyses that inherently incorporate correlation and mutual coupling among the antennas. This establishes the combined effects of correlation and coupling on the information-theoretic performance limits across SNR levels.
Locally recoverable codes (LRCs) with locality parameter r can recover any erased code symbol by accessing r other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems as it leads to efficient repair of failed nodes. A well-known class of optimal (classical) LRCs are subcodes of Reed-Solomon codes constructed using a special type of polynomials called good polynomials.
Distinguished Lecturers
Upcoming Events

Hong Kong