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 51蹤獲 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 ITSocs 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 51蹤獲 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 51蹤獲 Joy Thomas Tutorial Paper Award is given to a paper of tutorial or survey nature that has appeared in an 51蹤獲 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 ITSocs Schools of Information Theory, held for the benefit of students and postdoctoral researchers.
Thomas M. Cover Dissertation Award
The 51蹤獲 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
The 8th International Coding Theory Seminar (ICTS 2025), INDIA
Join the 8th International Coding Theory Seminar (ICTS 2025) online on 26 Sept 2025, featuring talks by B. Sundar Rajan, Lalitha Vadlamani & Shayan S. Garani. Free but mandatory registration: https://sites.google.com/view/icts-2025
-
Call for Papers: XI苭 International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY 2025)
The 19th International Symposium on "Problems of Redundancy in Information and Control Systems" will take place on 05-07th November 2025. Paper submission deadline is the 22st of September, 2025.
Conferences
Nov 08, 2025
The Cornell Club - New York, 6 East 44th Street New York, NY 10017
BoG Meeting - Hybrid Meeting, NYC - November 2025
Sep 26, 2025
Online (Zoom)
The 8th International Coding Theory Seminar (ICTS 2025), INDIA
Join the 8th International Coding Theory Seminar (ICTS 2025) online on 26 Sept 2025, featuring
01-03 Oct, 2025
Oulu, Finland
ICNSC 2025
Call for Participation & Papers - 2025 International Conference on Networking, Sensing, and
Job list
Jobs Board
Assistant Professor of Electrical and Computer Engineering
Princeton University
The Department of Electrical and Computer Engineering seeks applications for faculty positions at
Sep 4, 2025
Postdoctoral Fellowship in Information Theory and Biological Information Processing
York University
Postdoctoral fellowship available in information theory and biological information processing at
Aug 19, 2025
PhD position in coding theory for distributed computing
DTU
Fully Funded 3-Year PhD Fellowship Coding and Visual Communication Group, DTU Electro (via DARA
Aug 14, 2025
News
2025 Jack Keil Wolf ISIT Student Paper Award Recipients Named
The three winning papers were announced during the banquet at ISIT 2025.
Jul 17, 2025
Call for Nominations: Joy Thomas Tutorial Paper Award
The Society solicits nominations for the 2026 51蹤獲 Joy Thomas Tutorial Paper Award. Deadline:
Jul 14, 2025
Call for Nominations: Padovani Lecturer, Goldsmith Lecturer, and Distinguished Lecturers
The 51蹤獲 Information Theory Society solicits nominations for the 2026 Padovani Lecturer, the 2026
Jul 14, 2025
Shannon Award for 2026
The 51蹤獲 Information Theory Society is pleased to announce that Frans Willems is the recipient of
Jun 26, 2025
News
Fellowships at the University of South Australia
Opportunity for travel funds in support of an Australian Government funded Fellowship application at the University of South Australia
Sep 22, 2009
Call For Papers: Special Issue on Cognitive Wireless Networks
International Journal of Communication Networks and Distributed Systems (IJCNDS): Call for papers for special issue on Cognitive Wireless Networks. Submission deadline: 1 Dec 2009.
Sep 9, 2009
Research Fellow Position: Satellite Data Communications
Position vacant at the Institute for Telecommunications Research, Adelaide, Australia
Sep 8, 2009
CFP: Elsevier Ad Hoc Networks Special Issue on Nanoscale Networking
There is plenty of room at the bottom as Feynman presciently stated about the atomic scale, and communication is needed down there. There is a growing trend of results from diverse approaches that both leverages and overcomes the environment at the nanoscale. These include molecular motors, random carbon nanotube networks, calcium signaling, and quantum networking to name a few. The goal of this issue is to focus upon ad hoc networking at the nanoscale and thus is not seeking static system-on-chip results unless they are in support of ad hoc nanoscale network approaches.
Aug 12, 2009
ICCES'09 Submission deadline extended to August 10
ICCES09 is the main conference in Computes and Systems Engineering in Egypt. It is organized by Ain Shams University, Copmuters and Systems Eng. Dept. and cosponsored by the 51蹤獲.
Aug 7, 2009
Postdoctoral nresearch fellow in coding theory
At the Department of Informatics, University of Bergen, Norway, there is a vacant position as postdoctoral fellow in coding theory for 3 years.
Announcement, see: https://secure.jobbnorge.no/Job.aspx?jobid=59725
Application deadline: August 20, 2009
Aug 3, 2009
Call for papers for IPSN 2010
The IPSN 2010 Conference, which will be held April 16-19, 2010, in conjunction with CPS WEEK 2010 in Stockholm, Sweden, has posted a call for papers. The abstract registration deadline is October 23, 2009.
Aug 3, 2009
2010 Claude E. Shannon Award
Jul 28, 2009
[REMINDER]: ITW 2009 Taormina, early registration deadline July 19th
ITW 2009 Taormina, early registration deadline July 19th
Jul 14, 2009
2009 51蹤獲 Information Theory Paper Award
Jun 30, 2009
2009 51蹤獲 Eric E. Sumner Award
Jun 30, 2009
2009 Joint ComSoc/ IT Society Paper Award
Jun 30, 2009
2009 ISIT Student Paper Award
Jun 30, 2009
2009 51蹤獲 Fellows
Jun 30, 2009
2009 51蹤獲 Awards and Medals
2009 51蹤獲 Awards and Medals, presented at ISIT 2009, Seoul, Korea, June 30, 2009
Jun 30, 2009
Marie Curie Fellowships
Marie Curie Fellowships open call (EU postdoctoral fellowships)
Jun 22, 2009
Research Fellow Position at University of Melbourne
A RESEARCH FELLOW POSITION in coding is now open at the University of Melbourne, Australia, Dept of Electrical and Electronic Engineering
Jun 11, 2009
BBVA Foundation Award Call for Nominations
Nominations for the BBVA Foundation Frontiers of Knowledge Award in Information and Communication Technology are due June 30.
Jun 9, 2009
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 51蹤獲 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
51蹤獲 JSAIT on the Information Theory Magazine
Synchronization errors, arising from both synthesis and sequencing noise, present a fundamental challenge in DNA-based data storage systems. These errors are often modeled as insertion-deletion-substitution (IDS) channels, for which maximum-likelihood decoding is quite computationally expensive. In this work, we propose a data-driven approach based on neural polar decoders (NPDs) to design decoders with reduced complexity for channels with synchronization errors.
51蹤獲 JSAIT on the Information Theory Magazine
As a potential implementation of data storage using DNA molecules, multiple strands of DNA are stored unordered in a liquid container. When the data are needed, an array of DNA readers will sample the strands with replacement, producing a Poisson-distributed number of noisy reads for each strand. The primary challenge here is to design an algorithm that reconstructs data from these unsorted, repetitive, and noisy reads.
51蹤獲 JSAIT on the Information Theory Magazine
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical n,k,d叮+1 binary linear code with certain additional properties, we show that pure [n,k,m+1]]2 quantum error-correcting codes (QECCs) can be constructed within the codeword stabilized (CWS) code framework. As illustrations, we construct pure [[22r-1,22r-2r-3,3]]2 and [[(24r-1)2,(24r-1)2-32r-7,5]]2 QECCs.
51蹤獲 JSAIT on the Information Theory Magazine
The standard approach to universal fault-tolerant quantum computing is to develop a general purpose quantum error correction mechanism that can implement a universal set of logical gates fault-tolerantly. Given such a scheme, any quantum algorithm can be realized fault-tolerantly by composing the relevant logical gates from this set. However, we know that quantum computers provide a significant quantum advantage only for specific quantum algorithms.
51蹤獲 JSAIT on the Information Theory Magazine
The number of degrees of freedom (NDoF) in a communication channel fundamentally limits the number of independent spatial modes available for transmitting and receiving information. Although the NDoF can be computed numerically for specific configurations using singular value decomposition (SVD) of the channel operator, this approach provides limited physical insight. In this paper, we introduce a simple analytical estimate for the NDoF between arbitrarily shaped transmitter and receiver regions in free space.
51蹤獲 JSAIT on the Information Theory Magazine
We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool. Motivated by recent DNA storage techniques, we focus on the regime in which the input resolution is unlimited.
51蹤獲 JSAIT on the Information Theory Magazine
This paper studies achievable rates of nanopore-based DNA storage when nanopore signals are decoded using a tractable channel model that does not rely on a basecalling algorithm. Specifically, the noisy nanopore channel (NNC) with the Scrappie pore model generates average output levels via i.i.d. geometric sample duplications corrupted by i.i.d. Gaussian noise (NNC-Scrappie). Simplified message passing algorithms are derived for efficient soft decoding of nanopore signals using NNC-Scrappie.
51蹤獲 JSAIT on the Information Theory Magazine
In this paper, we consider a recent channel model of a nanopore sequencer proposed by McBain, Viterbo, and Saunderson (2024), termed the noisy nanopore channel (NNC). In essence, an NNC is a duplication channel with structured, Markov inputs, that is corrupted by memoryless noise. We first discuss a (tight) lower bound on the capacity of the NNC in the absence of random noise. Next, we present lower and upper bounds on the channel capacity of general noisy nanopore channels.
51蹤獲 JSAIT on the Information Theory Magazine
The central problem in sequence reconstruction is to find the minimum number of distinct channel outputs required to uniquely reconstruct the transmitted sequence. According to Levenshteins work in 2001, this number is determined by the size of the maximum intersection between the error balls of any two distinct input sequences of the channel. In this work, we study the sequence reconstruction problem for the q-ary single-deletion single-substitution channel for any fixed integer q2.
51蹤獲 JSAIT on the Information Theory Magazine
In DNA sequencing, we often need to infer an unknown sequence from a collection of its corrupted copies. Each copy cannot faithfully tell the truth due to DNA fragmentation, point mutations, and measurement errors. The theoretical guarantee of unique reconstruction is thus of concern. This motivated the study of sequence reconstruction problems three decades ago. Recently, synthetic DNA has been regarded as an ultra-dense data storage medium. Sequence reconstruction is a crucial step in achieving reliable and efficient data readout.
Upcoming Events
The Information Theory Society's upcoming conferences, workshops and schools
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.
07-11
Dec
The University of Melbourne, Grattan Street, Parkville, Victoria 3010, Australia
Deadline:
The 11th International Workshop on Signal Design and its Applications in Communications(IWSDA'25)
The 11th International Workshop on Signal Design and its Applications in Communications(IWSDA'25) will be held at The University of Melbourne,