3 citations · 4 across the 3 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2024
Improved bounds on the interactive capacity via error pattern analysis
Mudit Aggarwal, Manuj Mukherjee
Any interactive protocol between a pair of parties can be reliably simulated in the presence of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The re…
cs.IT2023★ 1 cited
Optimal storage codes on graphs with fixed locality
Sabyasachi Basu, Manuj Mukherjee
Storage codes on graphs are an instance of \emph{codes with locality}, which are used in distributed storage schemes to provide local repairability. Specifically, the nodes of the…
cs.IT2017★ 3 cited
Secret Key Agreement under Discussion Rate Constraints
Chung Chan, Manuj Mukherjee, Navin Kashyap +1
For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below th…