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.
Get Involved
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.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
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
Â鶹´«Ã½AV BITS the Information Theory Magazine
Â鶹´«Ã½AV 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.
Recent Journal Issues
Â鶹´«Ã½AV Journal on Selected Areas in Information Theory
The Â鶹´«Ã½AV Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.
Research In Information Theory
In this article, we consider a particular data structure consisting of a union of several nested low-rank subspaces with missing data entries. Given the rank of each subspace, we treat the data completion problem, i.e., to estimate the missing entries. Starting from the case of two-dimensional data, i.e., matrices, we show that the union of nested subspaces data structure leads to a structured decomposition U = XY where the factor Y has blocks of zeros that are determined by the rank values.
We study hypergraph clustering in the weighted d-uniform hypergraph stochastic block model (d -WHSBM), where each edge consisting of d nodes from the same community has higher expected weight than the edges consisting of nodes from different communities. We propose a new hypergraph clustering algorithm, called CRTMLE, and provide its performance guarantee under the d -WHSBM for general parameter regimes. We show that the proposed method achieves the order-wise optimal or the best existing results for approximately balanced community sizes.
Quantum phenomena provide computing and information handling paradigms that are clearly different and very likely much more powerful than their classical counterparts. Over the past few years, several governments throughout the world have allocated substantial funding aimed at boosting quantum information science. Much progress has been made on the theoretical side, and experiments have been conducted in which quantum computational operations were executed on a small number of quantum bits.
We investigate the quantum-secure covert-communication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: Lno-EA, when Alice and Bob share only a classical secret, and LEA, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication.
Quantum information science is an exciting, wide, rapidly progressing, cross-disciplinary field, and that very nature makes it both attractive and hard to enter. In this primer, we first provide answers to the three essential questions that any newcomer needs to know: How is quantum information represented? How is quantum information processed? How is classical information extracted from quantum states?
It is known that quantum resources can allow us to achieve a family of equilibria that can have sometimes a better social welfare, while guaranteeing privacy. We use graph games to propose a way to build non-cooperative games from graph states, and we show how to achieve an unlimited improvement with quantum advice compared to classical advice.