| Reliable deniable communication: Hiding messages in noise PH Che, M Bakshi, S Jaggi 2013 IEEE International Symposium on Information Theory, 2945-2949, 2013 | 337 | 2013 |
| Efficient algorithms for noisy group testing S Cai, M Jahangoshahi, M Bakshi, S Jaggi IEEE Transactions on Information Theory 63 (4), 2113-2136, 2017 | 109* | 2017 |
| Concatenated polar codes M Bakshi, S Jaggi, M Effros 2010 IEEE International Symposium on Information Theory, 918-922, 2010 | 101 | 2010 |
| Reliable deniable communication with channel uncertainty PH Che, M Bakshi, C Chan, S Jaggi 2014 IEEE information theory workshop (ITW 2014), 30-34, 2014 | 98 | 2014 |
| Covert communication over adversarially jammed channels Q Zhang, M Bakshi, S Jaggi IEEE Transactions on Information Theory 67 (9), 6096-6121, 2021 | 40 | 2021 |
| Reliable, deniable and hidable communication PH Che, M Bakshi, C Chan, S Jaggi 2014 Information Theory and Applications Workshop (ITA), 1-10, 2014 | 33 | 2014 |
| Reliable, deniable and hidable communication: A quick survey PH Che, S Kadhe, M Bakshi, C Chan, S Jaggi, A Sprintson 2014 IEEE Information Theory Workshop (ITW 2014), 227-231, 2014 | 31 | 2014 |
| Stochastic threshold group testing CL Chan, S Cai, M Bakshi, S Jaggi, V Saligrama 2013 IEEE Information Theory Workshop (ITW), 1-5, 2013 | 30* | 2013 |
| SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits M Bakshi, S Jaggi, S Cai, M Chen IEEE Transactions on Information Theory 62 (12), 7419-7444, 2015 | 29 | 2015 |
| Reliable, deniable, and hidable communication over multipath networks S Kadhe, S Jaggi, M Bakshi, A Sprintson 2014 IEEE International Symposium on Information Theory, 611-615, 2014 | 29 | 2014 |
| Triple decomposition and tensor recovery of third order tensors L Qi, Y Chen, M Bakshi, X Zhang SIAM Journal on Matrix Analysis and Applications 42 (1), 299-329, 2021 | 27 | 2021 |
| Covert communication with polynomial computational complexity Q Zhang, M Bakshi, S Jaggi IEEE Transactions on Information Theory 66 (3), 1354-1384, 2019 | 25* | 2019 |
| Undetectable radios: Covert communication under spectral mask constraints QE Zhang, MR Bloch, M Bakshi, S Jaggi 2019 IEEE International Symposium on Information Theory (ISIT), 992-996, 2019 | 24 | 2019 |
| On achievable rates for multicast in the presence of side information M Bakshi, M Effros 2008 IEEE International Symposium on Information Theory, 1661-1665, 2008 | 20 | 2008 |
| Computationally efficient deniable communication Q Zhang, M Bakshi, S Jaggi 2016 IEEE International Symposium on Information Theory (ISIT), 2234-2238, 2016 | 19 | 2016 |
| Super: Sparse signals with unknown phases efficiently recovered S Cai, M Bakshi, S Jaggi, M Chen 2014 IEEE International Symposium on Information Theory, 2007-2011, 2014 | 17 | 2014 |
| Talking reliably, secretly, and efficiently: A “complete” characterization Q Zhang, S Kadhe, M Bakshi, S Jaggi, A Sprintson 2015 IEEE Information Theory Workshop (ITW), 1-5, 2015 | 16 | 2015 |
| On network coding of independent and dependent sources in line networks M Bakshi, M Effros, WH Gu, R Koetter 2007 IEEE International Symposium on Information Theory, 1096-1100, 2007 | 16 | 2007 |
| Coding against a limited-view adversary: The effect of causality and feedback Q Zhang, S Kadhe, M Bakshi, S Jaggi, A Sprintson 2015 IEEE International Symposium on Information Theory (ISIT), 2530-2534, 2015 | 15 | 2015 |
| Multiple access channels with adversarial users N Sangwan, M Bakshi, BK Dey, VM Prabhakaran 2019 IEEE International Symposium on Information Theory (ISIT), 435-439, 2019 | 14 | 2019 |
Sidharth (Sid) JaggiProfessor, School of Mathematics, University of BristolVerified email at bristol.ac.uk
