research
∙
06/13/2023
Competitive Channel-Capacity
We consider communication over channels whose statistics are not known i...
share
research
∙
05/10/2023
Perfect vs. Independent Feedback in the Multiple-Access Channel
The multiple access channel (MAC) capacity with feedback is considered u...
research
∙
02/07/2023
Multiple Key-cast over Networks
The multicast key-dissemination problem over noiseless networks, introdu...
research
∙
05/13/2022
The Capacity of Causal Adversarial Channels
We characterize the capacity for the discrete-time arbitrarily varying c...
research
∙
02/10/2022
Group Testing on General Set-Systems
Group testing is one of the fundamental problems in coding theory and co...
research
∙
02/08/2022
Network Coding Multicast Key-Capacity
For a multi-source multi-terminal noiseless network, the key-disseminati...
research
∙
02/03/2022
On the Benefit of Cooperation in Relay Networks
This work addresses the cooperation facilitator (CF) model, in which net...
research
∙
02/04/2021
Minimizing the alphabet size in codes with restricted error sets
This paper focuses on error-correcting codes that can handle a predefine...
research
∙
02/02/2021
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel
The work at hand presents a finite-blocklength analysis of the multiple ...
research
∙
01/28/2021
Beyond Capacity: The Joint Time-Rate Region
The traditional notion of capacity studied in the context of memoryless ...
research
∙
05/20/2020
Edge removal in undirected networks
The edge-removal problem asks whether the removal of a λ-capacity edge f...
research
∙
05/14/2020
Minimizing the alphabet size of erasure codes with restricted decoding sets
A Maximum Distance Separable code over an alphabet F is defined via an e...
research
∙
03/12/2020
Topology Dependent Bounds For FAQs
In this paper, we prove topology dependent bounds on the number of round...
research
∙
02/03/2020
Towards an Operational Definition of Group Network Codes
Group network codes are a generalization of linear codes that have seen ...
research
∙
11/24/2019
Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases
In communication networks, cooperative strategies are coding schemes whe...
research
∙
07/08/2019
Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys
It is common in the study of secure multicast network coding in the pres...
research
∙
07/02/2019
A Local Perspective on the Edge Removal Problem
The edge removal problem studies the loss in network coding rates that r...
research
∙
05/08/2018
Quadratically Constrained Channels with Causal Adversaries
We consider the problem of communication over a channel with a causal ja...
research
∙
02/13/2018
The Birthday Problem and Zero-Error List Codes
As an attempt to bridge the gap between classical information theory and...
research
∙
01/11/2018
