This is a page with all possible (non-custom) blocks
Used to be "Covid-19 updates"
Awards
Aaron D. Wyner Distinguished Service Award
The Aaron D. Wyner Distinguished Service Award honors an individual who has shown outstanding leadership in, and provided long-standing, exceptional service to, the Information Theory community.
Claude E. Shannon Award
The Claude E. Shannon Award is the highest honor from the ÌÇÐÄlogo Information Theory Society. The award has been instituted to honor consistent and profound contributions to the field of information theory.
Communications Society & Information Theory Society Joint Paper Award
The Communications Society & Information Theory Society Joint Paper Award recognizes outstanding papers that lie at the intersection of communications and information theory.
Goldsmith Lecturer
The Goldsmith Lecturer Program was established with a generous gift of Dr. Andrea Goldsmith in 2019. The Goldsmith Lecture will be delivered by an early-career woman researcher at one of the ITSoc’s Schools of Information Theory, held for the benefit of students and postdoctoral researchers.
Information Theory Society Paper Award
The Information Theory Society Paper Award is given annually for an outstanding publication in the fields of interest to the Society appearing anywhere during the preceding four calendar years.
Jack Keil Wolf ISIT Student Paper Award
The ÌÇÐÄlogo Jack Keil Wolf ISIT Student Paper Award is given to up to 3 outstanding papers for which a student is the principal author and presenter.
James L. Massey Research & Teaching Award for Young Scholars
The James L. Massey Research & Teaching Award for Young Scholars recognizes outstanding achievement in research and teaching by young scholars in the Information Theory community.
Joy Thomas Tutorial Paper Award
The ÌÇÐÄlogo Joy Thomas Tutorial Paper Award is given to a paper of tutorial or survey nature that has appeared in an ÌÇÐÄlogo Information Theory Society publication.
Padovani Lecturer
The Padovani Lecturer Program was established with a generous gift of Dr. Roberto Padovani in 2009. The Padovani Lecture will be delivered by an outstanding member of the Information Theory community at one of the ITSoc’s Schools of Information Theory, held for the benefit of students and postdoctoral researchers.
Thomas M. Cover Dissertation Award
The ÌÇÐÄlogo Information Theory Society Thomas M. Cover Dissertation Award is awarded annually to the author of an outstanding doctoral dissertation contributing to the mathematical foundations of any of the information sciences within the purview of the Society.
Awards
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.
Events
Conferences, Workshops & Meetings
-
Deadline Extension: 2025 Asia Pacific Workshop on Data Science and Information Theory (APWDSIT'25)
The deadline for paper submission to the 2025 Asia Pacific Workshop on Data Science and Information Theory (APWDSIT'25) , Shenzhen, China, has been extended to July 6, 2025 (AoE).
-
Workshop on Distributed Computing, Optimization and Learning
The 2025 Workshop on Distributed Computing, Optimization and Learning takes place at the campus of the Technical University of Munich on September 3 to 5. The workshop consists of invited talks and contributed posters.
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…
Job list
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
News
Shannon Award for 2026
The ÌÇÐÄlogo Information Theory Society is pleased to announce that Frans Willems is the recipient of…
Jun 26, 2025
Recipients of the 2025 ÌÇÐÄlogo 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
News
Call for entries for "Beyond i.i.d. 2018"
Suggestions for invited talks for "Beyond i.i.d. 2018" are solicited from the community, to be submitted by March 31, 2018. The workshop will be held in Cambridge, UK from July 23 to July 27, 2018.
Mar 7, 2018
ISITA 2018 in Singapore: Deadline extension and Call for Papers
Paper submission deadline is extended for ISITA 2018 in Singapore from Oct. 28 to Oct. 31. The submission deadline is April 13. Details are at http://www.isita2018.org/
Mar 7, 2018
ITSOC statement on conduct and ethics
The following statement reaffirms the Society's commitment to the ÌÇÐÄlogo Code of Conduct, ÌÇÐÄlogo Code of Ethics, and ÌÇÐÄlogo Nondiscrimination Policy.
Mar 3, 2018
CFP : Allerton 2018
Each year, the Allerton Conference draws some of the brightest minds from industry, academia and government to discuss innovation in the fields of communication, control and computing. Papers are due July 9, 2018
Mar 2, 2018
Videos from the Bombay Information Theory Seminar Available
BITS 2018 was held during January 11-14, 2018 in Mumbai.
Mar 2, 2018
CFP : The Second International Balkan Conference on Communications and Networking (BalkanCom 2018)
The Second International Balkan Conference on Communications and Networking (BalkanCom 2018) will be held from June 6-8, 2018 in Podgorica, Montenegro.
Mar 2, 2018
Deadline extension for nominations for Shannon and Wyner Awards
Due to server stability issues in the last few days, nominations for the Shannon and Wyner awards through the website may have been disrupted.
Mar 2, 2018
ÌÇÐÄlogo Statement on Conduct and Ethics
The following statement reaffirms the Society's commitment to the ÌÇÐÄlogo Code of Conduct, ÌÇÐÄlogo Code of Ethics, and ÌÇÐÄlogo Nondiscrimination Policy.
Feb 28, 2018
Past School of Information Theory Videos Available
The ITSOC Online Committee has posted videos from some past Schools of Information Theory for streaming
Feb 27, 2018
Eindhoven Workshop on Optical Communications
The workshop consists of invited talks in the area of optical communications and a poster session and will be held from April 8-10, 2018.
Feb 27, 2018
CFP : 2018 International Symposium on Turbo Codes & Iterative Information Processing
ISTC 2018 will be in Hong Kong in December and is seeking submissions due in June 2018.
Feb 27, 2018
2018 ITSoc Award Nomination Deadlines
Feb 15, 2018
Meet the Women of the Information Theory Society
Introducing women in information theory: learn about the triumphs, challenges, and secrets of a few women in information theory through these video interviews.
Feb 8, 2018
Call for Tutorials at 2018 ÌÇÐÄlogo Information Theory Workshop
Proposals for tutorials at the 2018 ÌÇÐÄlogo Information Theory Workshop in Guangzhou, China are solicited.
Deadline: March 1, 2018.
Feb 6, 2018
Postdoctoral Fellowship in Fundamental Limits of Learning, Duke University
The postdoc is at the IID center at Duke.
Feb 6, 2018
PhD Scholarship in Coding Theory at Monash University
A PhD scholarship is available at Monash University, Department of Electrical and Computer Systems Engineering, in the area of coding theory for distributed storage systems.
Jan 28, 2018
Entropy Special Issue: "Entropy and Information Inequalities"
Entropy (ISSN 1099-4300) invites submissions to the special issue "Entropy and Information Inequalities". The deadline for submission is June 29, 2018.
Jan 23, 2018
Tenure Track Faculty Position at the University of Hawaii
The Department of Electrical Engineering seeks applications in the areas of statistical learning, big data, and related topics. Strong candidates in other areas are encouraged to apply as well.
Jan 19, 2018
Postdoc Position at Purdue University
Jan 13, 2018
Past meeting
BoG Meeting - Hybrid Meeting @ ISIT 2025, Ann Arbor, Michigan
This will be a hybrid meeting, in-person and on zoom, in conjunction with ISIT 2025.
BoG Meeting - Hybrid Meeting @ ITA 2025, San Diego, California
This will be a hybrid meeting on zoom.
BOG Meeting - Hybrid Meeting @ University of Toronto
This will be a hybrid meeting in person room and on Zoom.
BoG Meeting - Hybrid Meeting @ ISIT 2024, Athens, Greece
This will be a hybrid meeting in person room and on zoom in conjunction with ISIT 2024.
BoG Meeting - Hybrid Meeting @ ITA 2024, San Diego, California
This will be a hybrid meeting on zoom. BoG members and approved presenters will receive an invite to the meeting.
BoG Meeting - Hybrid; Atlanta, GA 2023
This will be a hybrid meeting on zoom. BoG members and approved presenters will receive an invite to the meeting.
BoG Meeting - Hybrid Meeting @ ISIT 2023, Taipei, Taiwan
This will be a hybrid meeting in person room and on zoom in conjunction with ISIT 2023.
BoG Meeting - Hybrid Meeting @ ITA 2023, San Diego, California
This will be a hybrid meeting in person and on zoom in conjunction with ITA 2023.
BoG Meeting - October 2022
This will be a virtual meeting on zoom. BoG members and approved presenters will receive an invite to the meeting.
BoG Meeting - Hybrid Meeting @ ISIT 2022, Espoo, Finland
This will be a hybrid meeting in person and on zoom in conjunction with ISIT 2022.
BoG Meeting - March 2022
This will be a virtual meeting on zoom. BoG members and approved presenters will receive an invite to the meeting.
BoG Meeting - November 2021
This will be a virtual meeting on zoom. BoG members and approved presenters will receive an invite to the meeting.
BoG Meeting - June 2021
The second BoG meeting of 2021 will be held virtually on zoom. BOG members and approved presenters will receive an invite to the meeting.
BoG Meeting - March 2021
This will be a virtual meeting on zoom. BoG members and approved presenters will have received an invite to the meeting.
BoG Meeting @ New Brunswick, NJ - 2019
The third BoG Meeting of 2019 will take place at Rutgers University, New Brunswick, NJ.
BoG Meeting @ Chicago, IL 2015
Meeting will be held right after Allerton
BoG Meeting @ ISIT 2015, Hong Kong
Annual Meeting of the Information Theory Society
BoG Meeting - GlobalMeet
The BoG Meeting will be held via GlobalMeet on Saturday, September 20 (7:00 AM Pacific Time).
BoG Meeting @ ITA 2014, San Diego, CA
First BoG meeting of 2014
BoG Meeting @ ITA 2013, San Diego, CA
First BoG meeting of 2013
BoG meeting @ ITW 2012, Lausanne
Last BoG meeting of 2012.
BoG meeting @ ISIT 2012, Cambridge, MA
BoG meeting July 2012.
IT BoG meeting @ ITA 2012, UCSD
Meeting of the Board of Governors
BoG Meeting @ ITW 2011, Paraty, Brazil
The third BoG meeting of 2011 will take place on ***Monday*** October 17, in Paraty Brazil, in conjunction with ITW 2011, starting at about 6:00pm with a buffet dinner at the restaurant Banana de Terra (one block away from the conference center).
BoG Meeting @ ISIT 2011, St. Petersburg, Russia
The annual BoG meeting will take place on Sunday July 31, at the ISIT 2011 conference hotel, starting at 12:00 noon **sharp** with a buffet lunch. The meeting room is "Green 6+7" and will be clearly indicated at the registration desk, operational from Sunday July 31, morning. Please follow the signs and/or ask the registration desk in order to get to the lunch and meeting.
BoG Meeting, ISIT 2010
Annual meeting of the ÌÇÐÄlogo Information Theory Society Board of Governors. All are welcome to attend. Some portions of the meeting will be conducted in camera. The formal part of the meeting will commence at 12:45pm.
BoG Meeting, La Jolla, CA, 2010
First Board of Governors' meeting of 2010.
BoG Meeting, ITW Taormina 2009
The final BoG meeting of 2009. Dinner will be served at 6:30 and the meeting will start shortly thereafter. Everyone is welcome to attend. Meeting will be held in the Saletta Belvedere room of the Villa Diodoro (workshop hotel).
BoG Meeting, ISIT 2009
Annual meeting of the Information Theory Society BOGs. Everyone is welcome to attend all or part of the meeting. The meeting will be preceeded by lunch at 12:15, with the formal meeting starting at 1pm, ending at 5:30pm.
Research In Information Theory
Selected papers on information theory from our journals and conferences
ÌÇÐÄlogo 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.
ÌÇÐÄlogo 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.
ÌÇÐÄlogo 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.
ÌÇÐÄlogo 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.
ÌÇÐÄlogo 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.
ÌÇÐÄlogo JSAIT on the Information Theory Magazine
Kitaev’s toric code is one of the most prominent models for fault-tolerant quantum computation, currently regarded as the leading solution for connectivity constrained quantum technologies. Significant effort has been recently devoted to improving the error correction performance of the toric code under message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central role in both theory and practice of classical low-density parity-check codes.
ÌÇÐÄlogo JSAIT on the Information Theory Magazine
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.
ÌÇÐÄlogo JSAIT on the Information Theory Magazine
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to 31.
ÌÇÐÄlogo JSAIT on the Information Theory Magazine
In a recently introduced coset guessing game, Alice plays against Bob and Charlie, aiming to meet a joint winning condition. Bob and Charlie can only communicate before the game starts to devise a joint strategy. The game we consider begins with Alice preparing a 2m-qubit quantum state based on a random selection of three parameters. She sends the first m qubits to Bob and the rest to Charlie, and then reveals to them her choice for one of the parameters.
ÌÇÐÄlogo JSAIT on the Information Theory Magazine
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.
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 ÌÇÐÄlogo Information Theory Workshop (ITW)
The ÌÇÐÄlogo Information Theory Workshop (ITW) will be held in Sydney, Australia, Sep. 29 - Otc. 3, 2025.