Information Theory Society
The 51ÂÜÀò Information Theory Society is the premier professional society dedicated to the advancement of the mathematical underpinnings of information technology for the benefit of humanity. Information theory encompasses the processing, transmission, storage, and use of information, and the foundations of the communication process.
About Us
Become a Member
Aspects of Our Society
Plain
Outreach
A gathering of videos, books and more that show how information theory impacts our lives.
Meet IT Society Students
The Student and Outreach Subcommittee plans student and outreach activities at symposia and workshops.
Read Our Newsletter
The 51ÂÜÀò Information Theory Society Newsletter connects our members and is published four times a year.  Beginning with the March 2022 issue, the Newsletter is online only.Upcoming Events
The Information Theory Society's upcoming conferences, workshops and schools
03-08
Aug
Hong Kong
[applications can now be submitted] 2025 Croucher Summer Course in Information Theory (CSCIT 2025)
CSCIT 2025 will bring together PhD students and post-doctoral scholars from across Asia to learn and discuss cutting-edge research with world-…
29
Sep
03
Oct
Sydney, Australia
Deadline:
2025 51ÂÜÀò Information Theory Workshop (ITW)
The 51ÂÜÀò Information Theory Workshop (ITW) will be held in Sydney, Australia, Sep. 29 - Otc. 3, 2025.
News
Shannon Award for 2026
The 51ÂÜÀò Information Theory Society is pleased to announce that Frans Willems is the recipient of…
Jun 26, 2025
Recipients of the 2025 51ÂÜÀò 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…
Jun 26, 2025
2025 Information Theory Society Paper Award Recipients Named
The winners of the 2025 ITSoc Paper Award were announced at the ISIT 2025 awards session.
Jun 26, 2025
2025 ITSoc Chapter of the Year Announced!
The Benelux Section Chapter has been named the 2025 Chapter of the Year.
Jun 24, 2025
Conferences
27-29 Jul, 2025
Guangzhou, China
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…
03-08 Aug, 2025
The Chinese University of Hong Kong
Pre-announcement: 2025 Croucher Summer Course in Information Theory (CSCIT 2025)
Pre-announcement: 2025 Croucher Summer Course in Information Theory (CSCIT 2025)
…
18-22 Aug, 2025
Los Angeles, CA, USA
International Symposium on Topics in Coding 2025
The 13th International Symposium on Topics in Coding* will be held from Monday August 18th to…
Jobs Board
Postdoctoral Positions in the Information Theory, Probability and Statistics Unit
Okinawa Institute of Science and Technology (OIST)
We seek two strong candidates with a PhD in IT or Mathematics to work at the intersection of…
Jun 24, 2025
Postdoctoral Fellow in Quantum Information Theory and Quantum Machine Learning
Simula UiB
We are seeking a candidate with a PhD degree to work in the exciting and rapidly evolving field of…
Jun 19, 2025
Postdoc Positions in Communication, Quantum, Security, & ML
Arizona State University (ASU) and The University of Texas at Arlington (UTA)
Arizona State University (ASU) and The University of Texas at Arlington (UTA) are looking for…
May 29, 2025
Call to Action
Submit a paper. Get Involved.
Recent Journal Issues
51ÂÜÀò Journal on Selected Areas in Information Theory
JSAIT is a multi-disciplinary journal of special issues.
51ÂÜÀò BITS the Information Theory Magazine
BITS publishes tutorial articles on broad research areas viewed through an information-theoretic lens.
Research In Information Theory
Selected papers on information theory from our journals and conferences
51ÂÜÀò JSAIT on the Information Theory Magazine
CSS-T codes are a class of stabilizer codes introduced by Rengaswamy et al with desired properties for quantum fault-tolerance. In this work, we comprehensively study non-degenerate CSS-T codes built from Reed-Muller codes. These classical codes allow for constructing optimal CSS-T code families with nonvanishing asymptotic rates up to 12 and possibly diverging minimum distance when non-degenerate.
51ÂÜÀò JSAIT on the Information Theory Magazine
We propose a new systematic construction of CSS-T codes from any given CSS code using a map Ï•. When Ï• is the identity map I, we retrieve the construction of hu2021mitigating and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes.
51ÂÜÀò JSAIT on the Information Theory Magazine
In this paper, we introduce the Union-Intersection Union-Find (UIUF) algorithm for decoding depolarizing errors in topological codes, combining the strengths of iterative and standard Union-Find (UF) decoding. While iterative UF improves performance at moderate error rates, it lacks an error correction guarantee. To address this, we develop UIUF, which maintains the enhanced performance of iterative UF while ensuring error correction up to half the code distance.
51ÂÜÀò JSAIT on the Information Theory Magazine
We introduce a new erasure decoder that applies to arbitrary quantum LDPC codes. Dubbed the cluster decoder, it generalizes the decomposition idea of Vertical-Horizontal (VH) decoding introduced by Connolly et al. in 2022. Like the VH decoder, the idea is to first run the peeling decoder and then post-process the resulting stopping set. The cluster decoder breaks the stopping set into a tree of clusters, which can be solved sequentially via Gaussian Elimination.
51ÂÜÀò JSAIT on the Information Theory Magazine
Antenna efficiency is a key parameter in the design of large-scale dense arrays, and influences the signal-to-noise ratio (SNR) of wireless communications. Low embedded element efficiency (EEE) has been verified to be the bottleneck of dense array MIMO systems. Using ideas from the Floquet series, we propose a new framework to evaluate the mutual coupling for infinite arrays with a regular grid, including two new methods to calculate the EEE.
Distinguished Lecturers
The Distinguished Lecturers program promotes interest in information theory by supporting chapters who wish to invite prominent information theory researchers to give talks at their events.
