Folgen
Manuj Mukherjee
Manuj Mukherjee
Bestätigte E-Mail-Adresse bei iiitd.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On the public communication needed to achieve SK capacity in the multiterminal source model
M Mukherjee, N Kashyap, Y Sankarasubramaniam
IEEE Transactions on Information Theory 62 (7), 3811-3830, 2016
302016
On the optimality of secret key agreement via omniscience
C Chan, M Mukherjee, N Kashyap, Q Zhou
IEEE Transactions on Information Theory 64 (4), 2371-2389, 2018
222018
Secret key agreement under discussion rate constraints
C Chan, M Mukherjee, N Kashyap, Q Zhou
2017 IEEE International Symposium on Information Theory (ISIT), 1519-1523, 2017
172017
Achieving SK capacity in the source model: When must all terminals talk?
M Mukherjee, N Kashyap, Y Sankarasubramaniam
2014 IEEE International Symposium on Information Theory, 1156-1160, 2014
162014
Upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources
C Chan, M Mukherjee, N Kashyap, Q Zhou
IEEE Transactions on Information Theory 65 (8), 5080-5093, 2019
142019
When is omniscience a rate-optimal strategy for achieving secret key capacity?
C Chan, M Mukherjee, N Kashyap, Q Zhou
2016 IEEE Information Theory Workshop (ITW), 354-358, 2016
132016
Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model
M Mukherjee, C Chan, N Kashyap, Q Zhou
2016 IEEE International Symposium on Information Theory (ISIT), 2504-2508, 2016
132016
Multiterminal secret key agreement at asymptotically zero discussion rate
C Chan, M Mukherjee, N Kashyap, Q Zhou
2018 IEEE International Symposium on Information Theory (ISIT), 2654-2658, 2018
122018
On the communication complexity of secret key generation in the multiterminal source model
M Mukherjee, N Kashyap
2014 IEEE International Symposium on Information Theory, 1151-1155, 2014
92014
The communication complexity of achieving SK capacity in a class of PIN models
M Mukherjee, N Kashyap
2015 IEEE International Symposium on Information Theory (ISIT), 296-300, 2015
82015
On the secret key capacity of the Harary graph PIN model
N Kashyap, M Mukherjee, Y Sankarasubramaniam
2013 National Conference on Communications (NCC), 1-5, 2013
62013
Multiparty interactive coding over networks of intersecting broadcast links
M Mukherjee, R Gelles
IEEE Journal on Selected Areas in Information Theory 2 (4), 1078-1092, 2021
42021
Multiterminal Secret Key Agreement with Nearly No Discussion
C Chan, M Mukherjee, PK Vippathalla, Q Zhou
arXiv preprint arXiv:1904.11383, 2019
22019
Optimal storage codes on graphs with fixed locality
S Basu, M Mukherjee
arXiv preprint arXiv:2307.08680, 2023
12023
Reconfigurable Adaptive Channel Sensing
M Mukherjee, A Tchamkerten, C Jabbour
IEEE Transactions on Green Communications and Networking 7 (3), 1394-1406, 2023
12023
Generalization Bounds for Dependent Data using Online-to-Batch Conversion
S Chatterjee, M Mukherjee, A Sethi
arXiv preprint arXiv:2405.13666, 2024
2024
Improved bounds on the interactive capacity via error pattern analysis
M Aggarwal, M Mukherjee
arXiv preprint arXiv:2401.15355, 2024
2024
DEVICES AND METHODS FOR LOW POWER ADAPTIVE CHANNEL SENSING
M Mukherjee, A Tchamkerten, C Jabour
US Patent App. 17/787,301, 2023
2023
Multiparty Interactive Communication with Broadcast Links
M Mukherjee, R Gelles
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
2021
Approximating probability distributions by relu networks
M Mukherjee, A Tchamkerten, M Yousefi
2020 IEEE Information Theory Workshop (ITW), 1-5, 2021
2021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20