| 2026 | ISIT | Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly. | Sai Mineesh Reddy Kallupalli, Navin Kashyap |
| 2026 | ISIT | Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels. | Henry D. Pfister, Navin Kashyap, Jean-Franois Chamberland, Galen Reeves |
| 2026 | ISIT | Estimators for Substitution Rates in Genomes from Read Data. | Shiv Pratap Singh Rathore, Navin Kashyap |
| 2026 | ISIT | Recoverable systems and the maximal hard-core model on the square and triangular lattices. | Geyang Wang, Alexander Barg, Navin Kashyap |
| 2025 | ISIT | Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics. | Shiv Pratap Singh Rathore, Navin Kashyap |
| 2025 | ISIT | Recoverable Systems as Interaction Models: A Study by Example. | Geyang Wang, Alexander Barg, Navin Kashyap |
| 2024 | ISIT | Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. | Shreyas Jain, V Arvind Rameshwar, Navin Kashyap |
| 2024 | ISIT | On the Coverage Required for Diploid Genome Assembly. | Daanish Mahajan, Chirag Jain, Navin Kashyap |
| 2024 | ISIT | Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. | Prachi Mishra, Navin Kashyap |
| 2024 | ISIT | Sequentially Encodable Codeword Stabilized Codes. | Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap |
| 2023 | ISIT | A Version of Delsarte's Linear Program for Constrained Systems. | V Arvind Rameshwar, Navin Kashyap |
| 2023 | ISIT | Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. | V Arvind Rameshwar, Navin Kashyap |
| 2022 | ISIT | On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. | V Arvind Rameshwar, Navin Kashyap |
| 2022 | ISIT | Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. | Tania Sidana, Navin Kashyap |
| 2022 | ISIT | The Secure Storage Capacity of a DNA Wiretap Channel Model. | Praneeth Kumar Vippathalla, Navin Kashyap |
| 2022 | ITW | Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. | V Arvind Rameshwar, Navin Kashyap |
| 2022 | ITW | Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. | Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou |
| 2021 | ISIT | An MCMC Method to Sample from Lattice Distributions. | Anand Jerry George, Navin Kashyap |
| 2021 | ISIT | Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel. | V Arvind Rameshwar, Navin Kashyap |
| 2021 | ISIT | Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. | Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou |
| 2021 | WiOpt | An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. | B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran |
| 2020 | ISIT | Secure Information Exchange for Omniscience. | Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou |
| 2020 | ISIT | Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. | V Arvind Rameshwar, Navin Kashyap |
| 2020 | ISITA | On the Capacity of the Flash Memory Channel with Feedback. | V Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap |
| 2019 | ISIT | One-Shot Perfect Secret Key Agreement for Finite Linear Sources. | Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou |
| 2019 | ISIT | Computable Upper Bounds for Unifilar Finite-State Channels. | Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz |
| 2019 | ISIT | The Capacity of Count-Constrained ICI-Free Systems. | Navin Kashyap, Ron M. Roth, Paul H. Siegel |
| 2019 | ISIT | Probabilistic Forwarding of Coded Packets on Networks. | B. R. Vinay Kumar, Navin Kashyap |
| 2018 | ISIT | Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. | Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou |
| 2018 | ISITA | On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. | Shivkumar K. Manickam, Navin Kashyap |
| 2017 | ISIT | Secret key agreement under discussion rate constraints. | Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou |
| 2017 | ISIT | An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. | Oron Sabag, Haim H. Permuter, Navin Kashyap |
| 2016 | ISIT | Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. | Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou |
| 2016 | ISIT | A lattice coding scheme for secret key generation from Gaussian Markov tree sources. | Shashank Vatedka, Navin Kashyap |
| 2016 | ITW | When is omniscience a rate-optimal strategy for achieving secret key capacity? | Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou |
| 2015 | ISIT | Generalized belief propagation for estimating the partition function of the 2D Ising model. | Chun Lam Chan, Mahdi Jafari Siavoshani, Sidharth Jaggi, Navin Kashyap, Pascal O. Vontobel |
| 2015 | ISIT | The communication complexity of achieving SK capacity in a class of PIN models. | Manuj Mukherjee, Navin Kashyap |
| 2015 | ITW | Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. | Oron Sabag, Haim H. Permuter, Navin Kashyap |
| 2015 | ITW | Some "goodness" properties of LDA lattices. | Shashank Vatedka, Navin Kashyap |
| 2015 | ITW | Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. | Shashank Vatedka, Navin Kashyap |
| 2014 | ISIT | On the communication complexity of secret key generation in the multiterminal source model. | Manuj Mukherjee, Navin Kashyap |
| 2014 | ISIT | Achieving SK capacity in the source model: When must all terminals talk? | Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam |
| 2013 | ISIT | Upper bounds on the size of grain-correcting codes. | Navin Kashyap, Gilles Zmor |
| 2013 | ISIT | Lattice coding for strongly secure compute-and-forward in a bidirectional relay. | V. Shashank, Navin Kashyap |
| 2013 | ITW | A phase transition for the uniform distribution in the pattern maximum likelihood problem. | Winston Fernandes, Navin Kashyap |
| 2013 | ITW | On 2-D non-adjacent-error channel models. | K. Manickam Shivkumar, Navin Kashyap |
| 2012 | ISIT | Secure computation in a bidirectional relay. | Navin Kashyap, V. Shashank, Andrew Thangaraj |
| 2012 | ISIT | Fault-tolerant secret key generation. | Himanshu Tyagi, Navin Kashyap, Yogesh Sankarasubramaniam, Kapali Viswanathan |
| 2011 | ISIT | On the treewidth of MDS and Reed-Muller codes. | Navin Kashyap, Andrew Thangaraj |
| 2010 | ISIT | Coding for high-density magnetic recording. | Arya Mazumdar, Alexander Barg, Navin Kashyap |
| 2010 | ITW | A graphical model for computing the minimum cost transposition distance. | Farzad Farnoud, Chien-Yu Chen, Olgica Milenkovic, Navin Kashyap |
| 2009 | DNA | The Effect of Malformed Tiles on Tile Assemblies within kTAM. | Ya Meng, Navin Kashyap |
| 2009 | ISIT | The zeta function of a periodic-finite-type shift. | Navin Kashyap, Akiko Manada |
| 2008 | ISIT | On the period of a periodic-finite-type shift. | Akiko Manada, Navin Kashyap |
| 2007 | ISIT | Code Decomposition: Theory and Applications. | Navin Kashyap |
| 2006 | ISIT | On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type. | Akiko Manada, Navin Kashyap |
| 2005 | ISIT | DNA codes that avoid secondary structures. | Olgica Milenkovic, Navin Kashyap |
| 2004 | ISIT | Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity. | Navin Kashyap, Paul H. Siegel |
| 2004 | ISIT | A Ramsey theory approach to ghostbusting. | Navin Kashyap, Paul H. Siegel, Alexander Vardy |
| 1999 | DCC | Codes for Data Synchronization with Timing. | Navin Kashyap, David L. Neuhoff |