Manuj Mukherjee

Alhad Sethi

CoRR, 2024

Computation in Server-Assisted Noisy Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Information Exchange is Harder with Noise at Source.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Improved Bounds on the Interactive Capacity via Error Pattern Analysis.

[BibT_eX]

[DOI]

Mudit Aggarwal

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Reconfigurable Adaptive Channel Sensing.

[BibT_eX]

[DOI]

Aslan Tchamkerten

Chadi Jabbour

IEEE Trans. Green Commun. Netw., September, 2023

Optimal storage codes on graphs with fixed locality.

[BibT_eX]

[DOI]

Sabyasachi Basu

CoRR, 2023

2021

Multiparty Interactive Coding Over Networks of Intersecting Broadcast Links.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Multiparty Interactive Communication with Broadcast Links.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

2020

Approximating Probability Distributions by ReLU Networks.

[BibT_eX]

[DOI]

Aslan Tchamkerten

Mansoor I. Yousefi

Proceedings of the IEEE Information Theory Workshop, 2020

2019

Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Multiterminal Secret Key Agreement with Nearly No Discussion.

[BibT_eX]

[DOI]

Chung Chan

Praneeth Kumar Vippathalla

Qiaoqiao Zhou

CoRR, 2019

2018

On the Optimality of Secret Key Agreement via Omniscience.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Secret key agreement under discussion rate constraints.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model.

[BibT_eX]

[DOI]

Yogesh Sankarasubramaniam

IEEE Trans. Inf. Theory, 2016

When is omniscience a rate-optimal strategy for achieving secret key capacity?

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

The communication complexity of achieving SK capacity in a class of PIN models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Achieving SK capacity in the source model: When must all terminals talk?

[BibT_eX]

[DOI]

Yogesh Sankarasubramaniam

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the communication complexity of secret key generation in the multiterminal source model.

[BibT_eX]

[DOI]