Basic Image
Image
Summary for Basic Image
Basic Image
Image
Summary
Content Cards Block
Description of Content Cards
Plain
Cart title
Cart textCard title 2
Card textCard Title 3
Card text 3Sponsor's Logo
Title Description
The name of this block is "Title Description"
Recent Journal Issues
Journal Name
Journal description
Journal Name
Journal Description
Plain
Two Cards
This card provides an image
Title description link
Body of "Title description link"/ There is the option for a background image. Set "Fixed Container"
Events and meeting: Events and Meeting
Research In Information Theory
Selected papers on information theory from our journals and conferences
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.