93 citations · 385 across the 49 of their papers we have counts for
3 papers · 2 filters
The Birthday Problem and Zero-Error List Codes
Parham Noorzad, Michelle Effros, Michael Langberg +1
As an attempt to bridge the gap between the probabilistic world of classical information theory and the combinatorial world of zero-error information theory, this paper studies the…
Can Negligible Cooperation Increase Network Capacity? The Average-Error Case
Parham Noorzad, Michelle Effros, Michael Langberg
In communication networks, cooperative strategies are coding schemes where network nodes work together to improve network performance metrics such as sum-rate. This work studies en…
Random Access Channel Coding in the Finite Blocklength Regime
Recep Can Yavas, Victoria Kostina, Michelle Effros
Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy…