| Achievable rate region for three user discrete broadcast channel based on coset codes A Padakandla, SS Pradhan IEEE Transactions on Information Theory 64 (4), 2267-2297, 2018 | 37* | 2018 |
| Computing sum of sources over an arbitrary multiple access channel A Padakandla, SS Pradhan 2013 IEEE International Symposium on Information Theory, 2144-2148, 2013 | 34 | 2013 |
| An achievable rate region based on coset codes for multiple access channel with states A Padakandla, SS Pradhan IEEE Transactions on Information Theory 63 (10), 6393-6415, 2017 | 32 | 2017 |
| An achievable rate region for the three-user interference channel based on coset codes A Padakandla, AG Sahebi, SS Pradhan IEEE Transactions on Information Theory 62 (3), 1250-1279, 2016 | 28 | 2016 |
| An achievable rate region for the three-user interference channel based on coset codes A Padakandla, AG Sahebi, SS Pradhan IEEE Transactions on Information Theory 62 (3), 1250-1279, 2016 | 28 | 2016 |
| A new achievable rate region for the 3-user discrete memoryless interference channel A Padakandla, AG Sahebi, SS Pradhan 2012 IEEE International Symposium on Information Theory Proceedings, 2256-2260, 2012 | 20 | 2012 |
| Separable convex optimization problems with linear ascending constraints A Padakandla, R Sundaresan SIAM Journal on Optimization 20 (3), 1185-1204, 2010 | 20 | 2010 |
| Nested linear codes achieve Marton's inner bound for general broadcast channels A Padakandla, SS Pradhan 2011 IEEE International Symposium on Information Theory Proceedings, 1554-1558, 2011 | 16 | 2011 |
| Power minimization for CDMA under colored noise A Padakandla, R Sundaresan IEEE Transactions on Communications 57 (10), 3103-3112, 2009 | 14 | 2009 |
| A theoretical framework for learning from quantum data M Heidari, A Padakandla, W Szpankowski 2021 IEEE International Symposium on Information Theory (ISIT), 1469-1474, 2021 | 10 | 2021 |
| The trade-off between privacy and fidelity via Ehrhart theory A Padakandla, PR Kumar, W Szpankowski IEEE Transactions on Information Theory 66 (4), 2549-2569, 2019 | 8 | 2019 |
| Source coding for synthesizing correlated randomness TA Atif, A Padakandla, SS Pradhan IEEE Transactions on Information Theory 69 (1), 626-649, 2022 | 7 | 2022 |
| Communicating correlated sources over an interference channel A Padakandla 2017 IEEE International Symposium on Information Theory (ISIT), 1441-1445, 2017 | 7 | 2017 |
| Computing sum of sources over a classical-quantum MAC MA Sohail, TA Atif, A Padakandla, SS Pradhan IEEE Transactions on Information Theory 68 (12), 7913-7934, 2022 | 6 | 2022 |
| Computing sum of sources over a classical-quantum mac TA Atif, A Padakandla, SS Pradhan 2021 IEEE International Symposium on Information Theory (ISIT), 414-419, 2021 | 6 | 2021 |
| An Algebraic and Probabilistic Framework for Network Information Theory SS Pradhan, A Padakandla, F Shirani Now Foundations and Trends, 2021 | 6 | 2021 |
| An algebraic and probabilistic framework for network information theory SS Pradhan, A Padakandla, F Shirani Foundations and Trends® in Communications and Information Theory 18 (2), 173-379, 2020 | 6 | 2020 |
| Communicating correlated sources over a MAC A Padakandla 2017 IEEE International Symposium on Information Theory (ISIT), 1673-1677, 2017 | 6 | 2017 |
| Communicating correlated sources over a MAC in the absence of a Gács-Körner common part A Padakandla 2016 IEEE International Symposium on Information Theory (ISIT), 2014-2018, 2016 | 6 | 2016 |
| Unified approach for computing sum of sources over CQ-MAC MA Sohail, TA Atif, SS Pradhan 2022 IEEE International Symposium on Information Theory (ISIT), 1868-1873, 2022 | 5 | 2022 |
