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 IEEE 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 IEEE 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.
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 IEEE 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.
Conferences
Job list
Jobs Board
Postdoctoral Researcher Position on Information Theory and Coding
Bilkent University
Immediate openings for postdocs on insertion/deletion channels and DNA storage at Bilkent…
Mar 3, 2023
Postdoc Positions in Wireless Communications
University of Hawaii
Department of Electrical and Computer Engineering at University of Hawaii is looking for two…
Feb 22, 2023
Postdoctoral Position in Econometrics and Statistics
University of Vienna-Department of Statistics and Operations Research
The University of Vienna invites applications for a postdoctoral position in the field of…
Feb 10, 2023
News
Robert Calderbank - USC Viterbi Lecture, Thursday March 2, 2023
Robert Calderbank of Duke University will give the 2023 USC Viterbi Lecture on Thursday, March 2,…
Feb 28, 2023
Submission Deadline Approaching: JSAIT Issue on Role of Freshness and Semantic Measures
Call for Papers for JSAIT Issue on the Role of Freshness and Semantic Measures in the Transmission…
Feb 17, 2023
IEEE Information Theory Society Call for 2023 Award Nominations
Nominations are now open for paper awards as well as annual awards and recognition from the IEEE…
Jan 9, 2023
Aylin Yener Has Been Elected To Be the Next IEEE Division IX Director
The IT Society congratulates our Past President Aylin Yener for being elected to be the next IEEE…
Dec 22, 2022
News
Postdoctoral position in communications/robotics at USC
Postdoctoral researcher position available in Electrical Engineering, Computer Science or Mechanical Engineering fields within the Ming Hsieh Department of Electrical Engineering at the University of Southern California (USC). This position is in support of a multi-disciplinary Office of Naval Research grant funding four institutions: USC, the Woods Hole Oceanographic Institution, Northeastern University and the Massachusetts Institute of Technology.
Sep 28, 2009
Research Fellow: Markov Random Fields
Position vacant at at the Institute for Telecommunications Research, Adelaide
Sep 22, 2009
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 IEEE.
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 IEEE Information Theory Paper Award
Jun 30, 2009
2009 IEEE 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 IEEE Fellows
Jun 30, 2009
2009 IEEE Awards and Medals
2009 IEEE 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
Past meeting
Test Meeting with member edited
test excerpt
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 2023
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 IEEE 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
IEEE JSAIT on the Information Theory Magazine
Throughput and Latency Analysis for Line Networks With Outage Links
Wireless communication links suffer from outage events caused by fading and interference. To facilitate a tractable analysis of network communication throughput and latency, we propose an outage link model to represent a communication link in the slow fading phenomenon. For a line-topology network with outage links, we study three types of intermediate network node schemes: random linear network coding, store-and-forward, and hop-by-hop retransmission. We provide the analytical formulas for the maximum throughputs and the end-to-end latency for each scheme.
IEEE JSAIT on the Information Theory Magazine
Addressing GAN Training Instabilities via Tunable Classification Losses
Generative adversarial networks (GANs), modeled as a zero-sum game between a generator (G) and a discriminator (D), allow generating synthetic data with formal guarantees. Noting that D is a classifier, we begin by reformulating the GAN value function using class probability estimation (CPE) losses. We prove a two-way correspondence between CPE loss GANs and f-GANs which minimize f-divergences. We also show that all symmetric f-divergences are equivalent in convergence.
IEEE JSAIT on the Information Theory Magazine
Information Velocity of Cascaded Gaussian Channels With Feedback
We consider a line network of nodes, connected by additive white noise channels, equipped with local feedback. We study the velocity at which information spreads over this network. For transmission of a data packet, we give an explicit positive lower bound on the velocity, for any packet size. Furthermore, we consider streaming, that is, transmission of data packets generated at a given average arrival rate. We show that a positive velocity exists as long as the arrival rate is below the individual Gaussian channel capacity, and provide an explicit lower bound.
IEEE JSAIT on the Information Theory Magazine
Long-Term Fairness in Sequential Multi-Agent Selection with Positive Reinforcement
While much of the rapidly growing literature on fair decision-making focuses on metrics for one-shot decisions, recent work has raised the intriguing possibility of designing sequential decision-making to positively impact long-term social fairness. In selection processes such as college admissions or hiring, biasing slightly towards applicants from under-represented groups is hypothesized to provide positive feedback that increases the pool of under-represented applicants in future selection rounds, thus enhancing fairness in the long term.
IEEE JSAIT on the Information Theory Magazine
Controlled privacy leakage propagation throughout overlapping grouped learning
Federated Learning (FL) is the standard protocol for collaborative learning. In FL, multiple workers jointly train a shared model. They exchange model updates calculated on their data, while keeping the raw data itself local. Since workers naturally form groups based on common interests and privacy policies, we are motivated to extend standard FL to reflect a setting with multiple, potentially overlapping groups.
IEEE JSAIT on the Information Theory Magazine
Neural Distributed Source Coding
We consider the Distributed Source Coding (DSC) problem concerning the task of encoding an input in the absence of correlated side information that is only available to the decoder. Remarkably, Slepian and Wolf showed in 1973 that an encoder without access to the side information can asymptotically achieve the same compression rate as when the side information is available to it. This seminal result was later extended to lossy compression of distributed sources by Wyner, Ziv, Berger, and Tung.
IEEE JSAIT on the Information Theory Magazine
rTop-k: A Statistical Estimation Approach to Distributed SGD
The large communication cost for exchanging gradients between different nodes significantly limits the scalability of distributed training for large-scale learning models. Motivated by this observation, there has been significant recent interest in techniques that reduce the communication cost of distributed Stochastic Gradient Descent (SGD), with gradient sparsification techniques such as top-k and random-k shown to be particularly effective.
IEEE JSAIT on the Information Theory Magazine
A Unified Approach to Translate Classical Bandit Algorithms to the Structured Bandit Setting
We consider a finite-armed structured bandit problem in which mean rewards of different arms are known functions of a common hidden parameter 8*. Since we do not place any restrictions on these functions, the problem setting subsumes several previously studied frameworks that assume linear or invertible reward functions. We propose a novel approach to gradually estimate the hidden 8* and use the estimate together with the mean reward functions to substantially reduce exploration of sub-optimal arms.
IEEE JSAIT on the Information Theory Magazine
Minimax Estimation of Divergences Between Discrete Distributions
We study the minimax estimation of α-divergences between discrete distributions for integer α ≥ 1, which include the Kullback-Leibler divergence and the χ2-divergences as special examples. Dropping the usual theoretical tricks to acquire independence, we construct the first minimax rate-optimal estimator which does not require any Poissonization, sample splitting, or explicit construction of approximating polynomials.
IEEE JSAIT on the Information Theory Magazine
Convex Parameter Recovery for Interacting Marked Processes
We introduce a new general modeling approach for multivariate discrete event data with categorical interacting marks, which we refer to as marked Bernoulli processes. In the proposed model, the probability of an event of a specific category to occur in a location may be influenced by past events at this and other locations. We do not restrict interactions to be positive or decaying over time as it is commonly adopted, allowing us to capture an arbitrary shape of influence from historical events, locations, and events of different categories.
Videos on Information Theory
Find tutorials, lectures, keynotes and technical presentations on information theory
