We consider communication over channels whose statistics are not known i...
The multiple access channel (MAC) capacity with feedback is considered u...
The multicast key-dissemination problem over noiseless networks, introdu...
We characterize the capacity for the discrete-time arbitrarily varying
c...
Group testing is one of the fundamental problems in coding theory and
co...
For a multi-source multi-terminal noiseless network, the key-disseminati...
This work addresses the cooperation facilitator (CF) model, in which net...
This paper focuses on error-correcting codes that can handle a predefine...
The work at hand presents a finite-blocklength analysis of the multiple
...
The traditional notion of capacity studied in the context of memoryless
...
The edge-removal problem asks whether the removal of a λ-capacity
edge f...
A Maximum Distance Separable code over an alphabet F is defined via an
e...
In this paper, we prove topology dependent bounds on the number of round...
Group network codes are a generalization of linear codes that have seen
...
In communication networks, cooperative strategies are coding schemes whe...
It is common in the study of secure multicast network coding in the pres...
The edge removal problem studies the loss in network coding rates that
r...
We consider the problem of communication over a channel with a causal ja...
As an attempt to bridge the gap between classical information theory and...
In communication networks, cooperative strategies are coding schemes whe...