Codes for Data Synchronization with Timing. - Navin Kashyap; David L. Neuhoff (Data Compression Conference, 1999)

Data synchronization with timing. - Navin Kashyap; David L. Neuhoff (IEEE Trans. Inf. Theory, 2001)

On quantization with the Weaire-Phelan partition. - Navin Kashyap; David L. Neuhoff (IEEE Trans. Inf. Theory, 2001)

Maximizing the Shannon Capacity of Constrained Systems with Two Constraints. - Navin Kashyap (SIAM J. Discret. Math., 2003)

Equalities among Capacities of (d, k)-Constrained Systems. - Navin Kashyap; Paul H. Siegel (SIAM J. Discret. Math., 2003)

Ghostbusting: Coding for Optical Communications. - Navin Kashyap; Paul H. Siegel (Advances in Information Recording, 2004)

Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity. - Navin Kashyap; Paul H. Siegel (ISIT, 2004)

A Ramsey theory approach to ghostbusting. - Navin Kashyap; Paul H. Siegel; Alexander Vardy (ISIT, 2004)

Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity. - Navin Kashyap; Paul H. Siegel (IEEE Trans. Inf. Theory, 2004)

On DNA Computers Controlling Gene Expression Levels. - Olgica Milenkovic; Navin Kashyap; Bane Vasic (CDC/ECC, 2005)

DNA codes that avoid secondary structures. - Olgica Milenkovic; Navin Kashyap (ISIT, 2005)

On the Design of Codes for DNA Computing. - Olgica Milenkovic; Navin Kashyap (WCC, 2005)

An Application of Ramsey Theory to Coding for the Optical Channel. - Navin Kashyap; Paul H. Siegel; Alexander Vardy (SIAM J. Discret. Math., 2005)

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type. - Akiko Manada; Navin Kashyap (ISIT, 2006)

Periodic prefix-synchronized codes: A generating function approach. - Navin Kashyap; David L. Neuhoff (IEEE Trans. Inf. Theory, 2006)

Coding for the optical channel: the ghost-pulse constraint. - Navin Kashyap; Paul H. Siegel; Alexander Vardy (IEEE Trans. Inf. Theory, 2006)

Shortened Array Codes of Large Girth. - Olgica Milenkovic; Navin Kashyap; David Leyba (IEEE Trans. Inf. Theory, 2006)

The "Art of Trellis Decoding" Is NP-Hard. - Navin Kashyap (AAECC, 2007)

Code Decomposition: Theory and Applications. - Navin Kashyap (ISIT, 2007)

On the period of a periodic-finite-type shift. - Akiko Manada; Navin Kashyap (ISIT, 2008)

LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel. - Adam Cohen; Fady Alajaji; Navin Kashyap; Glen Takahara (IEEE Commun. Lett., 2008)

Matroid Pathwidth and Code Trellis Complexity. - Navin Kashyap (SIAM J. Discret. Math., 2008)

A Decomposition Theory for Binary Linear Codes. - Navin Kashyap (IEEE Trans. Inf. Theory, 2008)

Controlling errors in the process of molecular self-assembly. - Ya Meng; Navin Kashyap (Allerton, 2009)

The Effect of Malformed Tiles on Tile Assemblies within kTAM. - Ya Meng; Navin Kashyap (DNA, 2009)

A Comparative Study of Periods in a Periodic-Finite-Type Shift. - Akiko Manada; Navin Kashyap (SIAM J. Discret. Math., 2009)

On minimal tree realizations of linear codes. - Navin Kashyap (IEEE Trans. Inf. Theory, 2009)

Constraint complexity of realizations of linear codes on arbitrary graphs. - Navin Kashyap (IEEE Trans. Inf. Theory, 2009)

Data Synchronization With Timing: The Variable-Rate Case. - Navin Kashyap; David L. Neuhoff (IEEE Trans. Inf. Theory, 2009)

On the capacity of high-density recording on a 1-D granular magnetic medium. - Arya Mazumdar; Alexander Barg; Navin Kashyap (Allerton, 2010)

Coding for high-density magnetic recording. - Arya Mazumdar; Alexander Barg; Navin Kashyap (ISIT, 2010)

A graphical model for computing the minimum cost transposition distance. - Farzad Farnoud; Chien-Yu Chen 005; Olgica Milenkovic; Navin Kashyap (ITW, 2010)

The effect of malformed tiles on tile assemblies within the kinetic tile assembly model. - Ya Meng; Navin Kashyap (Nat. Comput., 2011)

Coding for High-Density Recording on a 1-D Granular Magnetic Medium. - Arya Mazumdar; Alexander Barg; Navin Kashyap (IEEE Trans. Inf. Theory, 2011)

Secure computation in a bidirectional relay. - Navin Kashyap; V. Shashank; Andrew Thangaraj (ISIT, 2012)

Fault-tolerant secret key generation. - Himanshu Tyagi; Navin Kashyap; Yogesh Sankarasubramaniam; Kapali Viswanathan (ISIT, 2012)

Secure Compute-and-Forward in a Bidirectional Relay - Navin Kashyap; V. Shashank; Andrew Thangaraj (CoRR, 2012)

The Treewidth of MDS and Reed-Muller Codes. - Navin Kashyap; Andrew Thangaraj (IEEE Trans. Inf. Theory, 2012)

Lattice coding for strongly secure compute-and-forward in a bidirectional relay. - V. Shashank; Navin Kashyap (ISIT, 2013)

A phase transition for the uniform distribution in the pattern maximum likelihood problem. - Winston Fernandes; Navin Kashyap (ITW, 2013)

On 2-D non-adjacent-error channel models. - K. Manickam Shivkumar; Navin Kashyap (ITW, 2013)

On the Zeta Function of a Periodic-Finite-Type Shift. - Akiko Manada; Navin Kashyap (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

On the communication complexity of secret key generation in the multiterminal source model. - Manuj Mukherjee; Navin Kashyap (ISIT, 2014)

Achieving SK capacity in the source model: When must all terminals talk? - Manuj Mukherjee; Navin Kashyap; Yogesh Sankarasubramaniam (ISIT, 2014)

Upper Bounds on the Size of Grain-Correcting Codes. - Navin Kashyap; Gilles Zémor (IEEE Trans. Inf. Theory, 2014)

The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. - Oron Sabag; Haim H. Permuter; Navin Kashyap (Allerton, 2015)

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 (ISIT, 2015)

The communication complexity of achieving SK capacity in a class of PIN models. - Manuj Mukherjee; Navin Kashyap (ISIT, 2015)

Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. - Oron Sabag; Haim H. Permuter; Navin Kashyap (ITW, 2015)

Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. - Shashank Vatedka; Navin Kashyap (ITW, 2015)

On linear subspace codes closed under intersection. - Pranab Basu; Navin Kashyap (NCC, 2015)

Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation. - Chun Lam Chan; Winston Fernandes; Navin Kashyap; Manjunath Krishnapur (CoRR, 2015)

The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel. - Oron Sabag; Haim H. Permuter; Navin Kashyap (CoRR, 2015)

Secure Compute-and-Forward in a Bidirectional Relay. - Shashank Vatedka; Navin Kashyap; Andrew Thangaraj (IEEE Trans. Inf. Theory, 2015)

Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. - Manuj Mukherjee; Chung Chan; Navin Kashyap; Qiaoqiao Zhou (ISIT, 2016)

A lattice coding scheme for secret key generation from Gaussian Markov tree sources. - Shashank Vatedka; Navin Kashyap (ISIT, 2016)

When is omniscience a rate-optimal strategy for achieving secret key capacity? - Chung Chan; Manuj Mukherjee; Navin Kashyap; Qiaoqiao Zhou (ITW, 2016)

The feedback capacity of the BIBO channel with a no-consecutive-ones input constraint. - Oron Sabag; Haim H. Permuter; Navin Kashyap (SPCOM, 2016)

A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. - Shashank Vatedka; Navin Kashyap (CoRR, 2016)

MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium. - N. V. Abhinav Das; Navin Kashyap (IEEE J. Sel. Areas Commun., 2016)

On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. - Manuj Mukherjee; Navin Kashyap; Yogesh Sankarasubramaniam (IEEE Trans. Inf. Theory, 2016)

The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. - Oron Sabag; Haim H. Permuter; Navin Kashyap (IEEE Trans. Inf. Theory, 2016)

Secret key agreement under discussion rate constraints. - Chung Chan; Manuj Mukherjee; Navin Kashyap; Qiaoqiao Zhou (ISIT, 2017)

An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. - Oron Sabag; Haim H. Permuter; Navin Kashyap (ISIT, 2017)

A maximization problem related to Huffman codes. - K. Manickam Shivkumar; Navin Kashyap (NCC, 2017)

Some "goodness" properties of LDA lattices. - Shashank Vatedka; Navin Kashyap (Probl. Inf. Transm., 2017)

Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation. - Chun Lam Chan; Winston Fernandes; Navin Kashyap; Manjunath Krishnapur (SIAM J. Discret. Math., 2017)

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. - Chung Chan; Manuj Mukherjee; Navin Kashyap; Qiaoqiao Zhou (ISIT, 2018)

On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. - Shivkumar K. Manickam; Navin Kashyap (ISITA, 2018)

On the Optimality of Secret Key Agreement via Omniscience. - Chung Chan; Manuj Mukherjee; Navin Kashyap; Qiaoqiao Zhou (IEEE Trans. Inf. Theory, 2018)

Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. - Oron Sabag; Haim H. Permuter; Navin Kashyap (IEEE Trans. Inf. Theory, 2018)

One-Shot Perfect Secret Key Agreement for Finite Linear Sources. - Chung Chan; Navin Kashyap; Praneeth Kumar Vippathalla; Qiaoqiao Zhou (ISIT, 2019)

Computable Upper Bounds for Unifilar Finite-State Channels. - Bashar Huleihel; Oron Sabag; Haim H. Permuter; Navin Kashyap; Shlomo Shamai Shitz (ISIT, 2019)

The Capacity of Count-Constrained ICI-Free Systems. - Navin Kashyap; Ron M. Roth; Paul H. Siegel (ISIT, 2019)

Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. - V Arvind Rameshwar 001; Navin Kashyap (NCC, 2019)

The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol. - B. R. Vinay Kumar; Roshan Antony; Navin Kashyap (CoRR, 2019)

The Lattice Structure of Linear Subspace Codes. - Pranab Basu; Navin Kashyap (CoRR, 2019)

Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. - Chung Chan; Manuj Mukherjee; Navin Kashyap; Qiaoqiao Zhou (IEEE Trans. Inf. Theory, 2019)

Secure Information Exchange for Omniscience. - Chung Chan; Navin Kashyap; Praneeth Kumar Vippathalla; Qiaoqiao Zhou (ISIT, 2020)

Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2020)

On the Capacity of the Flash Memory Channel with Feedback. - V Arvind Rameshwar 001; Aryabhatt M. Reghu; Navin Kashyap (ISITA, 2020)

How many modes can a constrained Gaussian mixture have? - Navin Kashyap; Manjunath Krishnapur (CoRR, 2020)

An MCMC Method to Sample from Lattice Distributions. - Anand Jerry George; Navin Kashyap (ISIT, 2021)

Bounds on the Feedback Capacity of the ($d, infty$)-RLL Input-Constrained Binary Erasure Channel. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2021)

Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. - Praneeth Kumar Vippathalla; Chung Chan; Navin Kashyap; Qiaoqiao Zhou (ISIT, 2021)

Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. - V Arvind Rameshwar 001; Navin Kashyap (CoRR, 2021)

Wiretap Secret Key Agreement Via Secure Omniscience. - Praneeth Kumar Vippathalla; Chung Chan; Navin Kashyap; Qiaoqiao Zhou (CoRR, 2021)

Deadline Constrained Packet Scheduling in the Presence of an Energy Harvesting Jammer. - Haseen Rahman; Ankith Vinayachandran; Sibi Raj B. Pillai; Kumar Appaiah; Rahul Vaze; Navin Kashyap (IEEE Trans. Green Commun. Netw., 2021)

Computable Upper Bounds on the Capacity of Finite-State Channels. - Bashar Huleihel; Oron Sabag; Haim H. Permuter; Navin Kashyap; Shlomo Shamai Shitz (IEEE Trans. Inf. Theory, 2021)

Probabilistic Forwarding of Coded Packets on Networks. - B. R. Vinay Kumar; Navin Kashyap (IEEE/ACM Trans. Netw., 2021)

On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2022)

Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. - Tania Sidana; Navin Kashyap (ISIT, 2022)

Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. - V Arvind Rameshwar 001; Navin Kashyap (ITW, 2022)

Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. - Praneeth Kumar Vippathalla; Chung Chan; Navin Kashyap; Qiaoqiao Zhou (ITW, 2022)

A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. - V Arvind Rameshwar 001; Navin Kashyap (SPCOM, 2022)

A Version of Delsarte's Linear Program for Constrained Systems. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2023)

Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2023)

Estimating the Sizes of Binary Error-Correcting Constrained Codes. - V Arvind Rameshwar 001; Navin Kashyap (IEEE J. Sel. Areas Inf. Theory, 2023)

An analysis of probabilistic forwarding of coded packets on random geometric graphs. - B. R. Vinay Kumar; Navin Kashyap; D. Yogeshwaran (Perform. Evaluation, 2023)

The Secure Storage Capacity of a DNA Wiretap Channel Model. - Praneeth Kumar Vippathalla; Navin Kashyap (IEEE Trans. Inf. Theory, 2023)

Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. - V Arvind Rameshwar 001; Navin Kashyap (IEEE Trans. Inf. Theory, 2023)

Secret Key Agreement via Secure Omniscience. - Praneeth Kumar Vippathalla; Chung Chan; Navin Kashyap; Qiaoqiao Zhou (IEEE Trans. Inf. Theory, 2023)

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. - Shreyas Jain; V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2024)

On the Coverage Required for Diploid Genome Assembly. - Daanish Mahajan; Chirag Jain; Navin Kashyap (ISIT, 2024)

Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. - Prachi Mishra; Navin Kashyap (ISIT, 2024)

Sequentially Encodable Codeword Stabilized Codes. - Sowrabh Sudevan; Sourin Das; Thamadathil Aswanth; Navin Kashyap (ISIT (Workshops), 2024)

Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. - V Arvind Rameshwar 001; Shreyas Jain; Navin Kashyap (NCC, 2024)

Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix. - Yuwen Huang; Navin Kashyap; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2024)

Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics. - Shiv Pratap Singh Rathore; Navin Kashyap (CoRR, 2025)