Information Theory Society
The Â鶹´«Ã½AV 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.
Aspects of Our Society
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 Â鶹´«Ã½AV 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
Deadline Extension: Â鶹´«Ã½AV-ITW'24
2024 Â鶹´«Ã½AV Information Theory Workshop (ITW)
Â鶹´«Ã½AV International Symposium on Information Theory (ISIT) 2025
News
Call for ISIT and ITW Proposals
Â鶹´«Ã½AV Information Theory Society is calling for proposals for the International Symposium on…
Call for Nominations: Padovani Lecturer, Goldsmith Lecturer, and Distinguished Lecturers
The Â鶹´«Ã½AV Information Theory Society solicits nominations for the 2025 Padovani Lecturer, the 2025…
Call for Nominations: Joy Thomas Tutorial Paper Award
The Society solicits nominations for the inaugural Â鶹´«Ã½AV Joy Thomas Tutorial Paper Award. Deadline:…
Dr. Mario Diaz Torres: Obituary and Request for Help
We regret to share that the IT Society lost a rising information theorist and statistician Dr.…
Conferences
2024 The International Symposium on Information Theory and Its Applications (ISITA2024)
The 2024 International Symposium on Information Theory and Its Applications (ISITA) will be held…
Australasian Summer School: Recent Trends in Algorithms
Free 4-day Australasian Summer School on "Recent Trends in Algorithms" at the University…
Â鶹´«Ã½AV Globecom 2024 Workshop on Channel Coding beyond 5G: Call for Papers
Workshop on Channel Coding beyond 5G (in conjunction with Â鶹´«Ã½AV Globecom 2024) is now open for…
Jobs Board
Postdoctoral Research Associate in Microfluidics, Nanofabrication, and Nanophotonics
Presidential Postdoctoral Fellow at Rutgers (deadline Oct 18)
We’re looking for talented researchers to join our team through the Rutgers Postdoctoral Fellowship…
Postdoc Opportunity at Rutgers ECE
🚨 **Postdoc Opportunity at Rutgers ECE!** 🚨 Join Dr. Salim El Rouayheb’s group to work on **…
Call to Action
Submit to Â鶹´«Ã½AV Journal on Selected Areas in Information Theory
The Â鶹´«Ã½AV Journal on Selected Areas in Information Theory (JSAIT) covers various aspects of information theory and its applications, and accepts submissions in response to specific calls for papers.
Recent Journal Issues
Â鶹´«Ã½AV Journal on Selected Areas in Information Theory
Â鶹´«Ã½AV BITS the Information Theory Magazine
Research In Information Theory
We develop data processing inequalities that describe how Fisher information from statistical samples can scale with the privacy parameter $\varepsilon $ under local differential privacy constraints. These bounds are valid under general conditions on the distribution of the score of the statistical model, and they elucidate under which conditions the dependence on $\varepsilon $ is linear, quadratic, or exponential.
In this article, we study the problem of non-adaptive group testing, in which one seeks to identify which items are defective given a set of suitably-designed tests whose outcomes indicate whether or not at least one defective item was included in the test. The most widespread recovery criterion seeks to exactly recover the entire defective set, and relaxed criteria such as approximate recovery and list decoding have also been considered.
The problem of distributed testing against independence with variable-length coding is considered when the average and not the maximum communication load is constrained as in previous works. The paper characterizes the optimum type-II error exponent of a single-sensor single-decision center system given a maximum type-I error probability when communication is either over a noise-free rate-R link or over a noisy discrete memoryless channel (DMC) with stop-feedback. Specifically, let E denote the maximum allowed type-I error probability.
We consider optimization using random projections as a statistical estimation problem, where the squared distance between the predictions from the estimator and the true solution is the error metric. In approximately solving a large-scale least squares problem using Gaussian sketches, we show that the sketched solution has a conditional Gaussian distribution with the true solution as its mean.