| Shortened array codes of large girth O Milenkovic, N Kashyap, D Leyba IEEE Transactions on Information Theory 52 (8), 3707-3722, 2006 | 133 | 2006 |
| On the design of codes for DNA computing O Milenkovic, N Kashyap Coding and Cryptography: International Workshop, WCC 2005, Bergen, Norway …, 2006 | 95 | 2006 |
| Stopping sets in codes from designs N Kashyap, A Vardy IEEE International Symposium on Information Theory, 2003. Proceedings., 122, 2003 | 52 | 2003 |
| Secure compute-and-forward in a bidirectional relay S Vatedka, N Kashyap, A Thangaraj IEEE Transactions on Information Theory 61 (5), 2531-2556, 2015 | 51 | 2015 |
| A decomposition theory for binary linear codes N Kashyap IEEE Transactions on Information Theory 54 (7), 3035-3058, 2008 | 50 | 2008 |
| Matroid pathwidth and code trellis complexity N Kashyap SIAM Journal on Discrete Mathematics 22 (1), 256-272, 2008 | 36 | 2008 |
| Coding for high-density recording on a 1-D granular magnetic medium A Mazumdar, A Barg, N Kashyap IEEE transactions on information theory 57 (11), 7403-7417, 2011 | 31 | 2011 |
| 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 | 28 | 2016 |
| DNA codes that avoid secondary structures O Milenkovic, N Kashyap Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005 | 26 | 2005 |
| The feedback capacity of the binary erasure channel with a no-consecutive-ones input constraint O Sabag, HH Permuter, N Kashyap IEEE Transactions on Information Theory 62 (1), 8-22, 2015 | 25 | 2015 |
| Coding for the optical channel: the ghost-pulse constraint N Kashyap, PH Siegel, A Vardy IEEE transactions on information theory 52 (1), 64-77, 2005 | 23 | 2005 |
| Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint O Sabag, HH Permuter, N Kashyap IEEE Transactions on Information Theory 64 (7), 4940-4961, 2018 | 21 | 2018 |
| 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 | 19 | 2018 |
| Data synchronization with timing N Kashyap, DL Neuhoff IEEE Transactions on Information Theory 47 (4), 1444-1460, 2001 | 18 | 2001 |
| 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 | 16 | 2017 |
| 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 | 15 | 2014 |
| Upper bounds on the size of grain-correcting codes N Kashyap, G Zémor IEEE transactions on information theory 60 (8), 4699-4709, 2014 | 14 | 2014 |
| 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 | 13 | 2016 |
| 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 | 12 | 2016 |
| On minimal tree realizations of linear codes N Kashyap IEEE transactions on information theory 55 (8), 3501-3519, 2009 | 12 | 2009 |
