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.
Who are we?
What do we do?
Learn More About ITSOC
Get Involved
Information theory is the study of the mathematical fundamentals of information transmission and storage.
Plain
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.News
Test News Ex
This excerpt is the tweet for social media. The title is not included in the tweet.
Nov 30, 2023
some random new tests
Mar 27, 2023
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
Conferences
Jobs
Test create jobs es
University of texas
Lorem ipsum.... This excerpt is the tweet for social media. The title is not included in the tweet.
Nov 30, 2023
Postdoctoral Researcher Position on Information Theory and Codings
Bilkent University New
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
Call to Action
IEEE BITS the Information Theory Magazine
IEEE 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.
Most recent issue
Magazine web site
Submit an article
Recent Journal Issues
IEEE Journal on Selected Areas in Information Theory
IEEE Journal on Selected Areas in Information Theory
IEEE Transactions on Information Theory
The IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.
Plain
Videos on Information Theory
Find tutorials, lectures, keynotes and technical presentations on information theory
Research In Information Theory
Selected papers on information theory from our journals and conferences
IEEE JSAIT on the Information Theory Magazine
Quantum Sensing and Communication via Non-Gaussian States
Quantum sensing and communication (QSC) is pivotal for developing next-generation networks with unprecedented performance. Many implementations of existing QSC systems employ Gaussian states as they can be easily realized using current technologies. However, Gaussian states lack non-classical properties necessary to unleash the full potential of QSC. This motivates the use of non-Gaussian states, which have non-classical properties beneficial for QSC. This paper establishes a theoretical foundation for QSC employing photon-varied Gaussian states (PVGSs).
IEEE JSAIT on the Information Theory Magazine
Source Coding for Markov Sources With Partial Memoryless Side Information at the Decoder
We consider the one helper source coding problem posed and investigated by Ahlswede, Körner, and Wyner for a class of information sources with memory. For this class of information sources we give explicit inner and outer bounds of the admissible rate region. We also give a certain nontrivial class of information sources where the inner and outer bounds match.
IEEE JSAIT on the Information Theory Magazine
Deviation From Maximal Entanglement for Mid-Spectrum Eigenstates of Local Hamiltonians
In a spin chain governed by a local Hamiltonian, we consider a microcanonical ensemble in the middle of the energy spectrum and a contiguous subsystem whose length is a constant fraction of the system size. We prove that if the bandwidth of the ensemble is greater than a certain constant, then the average entanglement entropy (between the subsystem and the rest of the system) of eigenstates in the ensemble deviates from the maximum entropy by at least a positive constant.
IEEE JSAIT on the Information Theory Magazine
Statistical Inference With Limited Memory: A Survey
The problem of statistical inference in its various forms has been the subject of decades-long extensive research. Most of the effort has been focused on characterizing the behavior as a function of the number of available samples, with far less attention given to the effect of memory limitations on performance. Recently, this latter topic has drawn much interest in the engineering and computer science literature.
IEEE JSAIT on the Information Theory Magazine
Tightening Continuity Bounds for Entropies and Bounds on Quantum Capacities
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between probability distributions or quantum states, typically, the total variation-or trace distance. However, if an additional distance measure is known, the continuity bounds can be significantly strengthened. Here, we prove a tight uniform continuity bound for the Shannon entropy in terms of both the local-and total variation distances, sharpening an inequality in I. Sason, IEEE Trans. Inf. Th., 59, 7118 (2013).
IEEE JSAIT on the Information Theory Magazine
Dynamic Group Testing to Control and Monitor Disease Progression in a Population
Proactive testing and interventions are crucial for disease containment during a pandemic until widespread vaccination is achieved. However, a key challenge remains: Can we accurately identify all new daily infections with only a fraction of tests needed compared to testing everyone, everyday?
IEEE JSAIT on the Information Theory Magazine
Shannon Bounds for Quadratic Rate-Distortion Problems
The Shannon lower bound has been the subject of several important contributions by Berger. This paper surveys Shannon bounds on rate-distortion problems under mean-squared error distortion with a particular emphasis on Berger’s techniques. Moreover, as a new result, the Gray-Wyner network is added to the canon of settings for which such bounds are known. In the Shannon bounding technique, elegant lower bounds are expressed in terms of the source entropy power.
IEEE JSAIT on the Information Theory Magazine
Computation of Binary Arithmetic Sum Over an Asymmetric Diamond Network
In this paper, the problem of zero-error network function computation is considered, where in a directed acyclic network, a single sink node is required to compute with zero error a function of the source messages that are separately generated by multiple source nodes. From the information-theoretic point of view, we are interested in the fundamental computing capacity, which is defined as the average number of times that the function can be computed with zero error for one use of the network.
IEEE JSAIT on the Information Theory Magazine
Low-Complexity Coding Techniques for Cloud Radio Access Networks
The problem of coding for the uplink and downlink of cloud radio access networks (C-RAN’s) with K users and L relays is considered. It is shown that low-complexity coding schemes that achieve any point in the rate-fronthaul region of joint coding and compression can be constructed starting from at most 4(K+L)-2 point-to-point codes designed for symmetric channels. This reduces the seemingly hard task of constructing good codes for C-RAN’s to the much better understood task of finding good codes for single-user channels.
IEEE JSAIT on the Information Theory Magazine
Erratum to “LightVeriFL: A Lightweight and Verifiable Secure Aggregation for Federated Learning”
This article addresses errors in [1]. Equation (2) contained an error wherein x was not bold. It is corrected below.
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.
