Navin Kashyap - RankMe

177 papers B 53C 2Journal 107Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly. CoRR K. Sai Mineesh Reddy, Navin Kashyap
2026	J	`jnl`	Directed Information: Estimation, Optimization and Applications in Communications and Causality. CoRR Dor Tsur, Oron Sabag, Navin Kashyap, Haim H. Permuter, Gerhard Kramer
2026	—	`conf`	Efficient RPA Decoding of Reed-Muller Codes with Structured 2-D Subspace Projections. NCC Vallabhaneni Kushal, Shiv Pratap Singh Rathore, Navin Kashyap
2026	J	`jnl`	Estimators for Substitution Rates in Genomes from Read Data. CoRR Shiv Pratap Singh Rathore, Navin Kashyap
2026	J	`jnl`	Recoverable systems and the maximal hard-core model on the triangular lattice. CoRR Geyang Wang, Alexander Barg, Navin Kashyap
2025	J	`jnl`	Codeword Stabilized Codes From m-Uniform Graph States. IEEE J. Sel. Areas Inf. Theory Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Nupur Patanker, Navin Kashyap
2025	J	`jnl`	Editorial Quantum Error Correction and Fault Tolerance. IEEE J. Sel. Areas Inf. Theory Navin Kashyap, Narayanan Rengaswamy, Bane Vasic, Pavel Panteleev
2025	J	`jnl`	On Quantum Computation Using Bias-Preserving Gates. CoRR Debadrito Roy, Aryaman Manish Kolhe, V. Lalitha, Navin Kashyap
2025	J	`jnl`	On the Coverage Required for Diploid Genome Assembly. IEEE Trans. Comput. Biol. Bioinform. Daanish Mahajan, Chirag Jain, Navin Kashyap
2025	B	`conf`	Recoverable Systems as Interaction Models: A Study by Example. ISIT Geyang Wang, Alexander Barg, Navin Kashyap
2025	J	`jnl`	Sampling-Based Estimates of the Weight Enumerators of Reed-Muller Codes. IEEE Trans. Commun. V Arvind Rameshwar, Shreyas Jain, Navin Kashyap
2025	J	`jnl`	The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence. CoRR Geyang Wang, Alexander Barg, Navin Kashyap
2025	B	`conf`	Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics. ISIT Shiv Pratap Singh Rathore, Navin Kashyap
2025	J	`jnl`	Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics. CoRR Shiv Pratap Singh Rathore, Navin Kashyap
2024	J	`jnl`	Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix. IEEE Trans. Inf. Theory Yuwen Huang, Navin Kashyap, Pascal O. Vontobel
2024	B	`conf`	Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. ISIT Prachi Mishra, Navin Kashyap
2024	J	`jnl`	Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. CoRR Prachi Mishra, Navin Kashyap
2024	B	`conf`	Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. ISIT Shreyas Jain, V Arvind Rameshwar, Navin Kashyap
2024	J	`jnl`	Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. CoRR Shreyas Jain, V Arvind Rameshwar, Navin Kashyap
2024	B	`conf`	On the Coverage Required for Diploid Genome Assembly. ISIT Daanish Mahajan, Chirag Jain, Navin Kashyap
2024	J	`jnl`	On the Coverage Required for Diploid Genome Assembly. CoRR Daanish Mahajan, Chirag Jain, Navin Kashyap
2024	—	`conf`	Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. NCC V Arvind Rameshwar, Shreyas Jain, Navin Kashyap
2024	—	`conf`	Sequentially Encodable Codeword Stabilized Codes. ISIT (Workshops) Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap
2024	J	`jnl`	Sequentially Encodable Codeword Stabilized Codes. CoRR Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap
2023	B	`conf`	A Version of Delsarte's Linear Program for Constrained Systems. ISIT V Arvind Rameshwar, Navin Kashyap
2023	J	`jnl`	An analysis of probabilistic forwarding of coded packets on random geometric graphs. Perform. Evaluation B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran
2023	J	`jnl`	Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. IEEE Trans. Inf. Theory V Arvind Rameshwar, Navin Kashyap
2023	B	`conf`	Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. ISIT V Arvind Rameshwar, Navin Kashyap
2023	J	`jnl`	Estimating the Sizes of Binary Error-Correcting Constrained Codes. CoRR V Arvind Rameshwar, Navin Kashyap
2023	J	`jnl`	Estimating the Sizes of Binary Error-Correcting Constrained Codes. IEEE J. Sel. Areas Inf. Theory V Arvind Rameshwar, Navin Kashyap
2023	J	`jnl`	Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. CoRR V Arvind Rameshwar, Shreyas Jain, Navin Kashyap
2023	J	`jnl`	Secret Key Agreement via Secure Omniscience. IEEE Trans. Inf. Theory Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2023	J	`jnl`	The Secure Storage Capacity of a DNA Wiretap Channel Model. IEEE Trans. Inf. Theory Praneeth Kumar Vippathalla, Navin Kashyap
2022	—	`conf`	A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. SPCOM V Arvind Rameshwar, Navin Kashyap
2022	J	`jnl`	A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR V Arvind Rameshwar, Navin Kashyap
2022	J	`jnl`	Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. CoRR V Arvind Rameshwar, Navin Kashyap
2022	B	`conf`	Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. ISIT Tania Sidana, Navin Kashyap
2022	J	`jnl`	Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. CoRR Tania Sidana, Navin Kashyap
2022	B	`conf`	Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. ITW V Arvind Rameshwar, Navin Kashyap
2022	J	`jnl`	Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. CoRR V Arvind Rameshwar, Navin Kashyap
2022	B	`conf`	On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. ISIT V Arvind Rameshwar, Navin Kashyap
2022	J	`jnl`	On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. CoRR V Arvind Rameshwar, Navin Kashyap
2022	B	`conf`	Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. ITW Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2022	B	`conf`	The Secure Storage Capacity of a DNA Wiretap Channel Model. ISIT Praneeth Kumar Vippathalla, Navin Kashyap
2022	J	`jnl`	The Secure Storage Capacity of a DNA Wiretap Channel Model. CoRR Praneeth Kumar Vippathalla, Navin Kashyap
2021	B	`conf`	An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. WiOpt B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran
2021	J	`jnl`	An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. CoRR B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran
2021	B	`conf`	An MCMC Method to Sample from Lattice Distributions. ISIT Anand Jerry George, Navin Kashyap
2021	J	`jnl`	An MCMC Method to Sample from Lattice Distributions. CoRR Anand Jerry George, Navin Kashyap
2021	B	`conf`	Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel. ISIT V Arvind Rameshwar, Navin Kashyap
2021	J	`jnl`	Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR V Arvind Rameshwar, Navin Kashyap
2021	J	`jnl`	Computable Upper Bounds on the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz
2021	J	`jnl`	Deadline Constrained Packet Scheduling in the Presence of an Energy Harvesting Jammer. IEEE Trans. Green Commun. Netw. Haseen Rahman, Ankith Vinayachandran, Sibi Raj B. Pillai, Kumar Appaiah, Rahul Vaze, Navin Kashyap
2021	J	`jnl`	Probabilistic Forwarding of Coded Packets on Networks. IEEE/ACM Trans. Netw. B. R. Vinay Kumar, Navin Kashyap
2021	B	`conf`	Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. ISIT Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2021	J	`jnl`	Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. CoRR Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2021	J	`jnl`	Wiretap Secret Key Agreement Via Secure Omniscience. CoRR Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2020	B	`conf`	Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. ISIT V Arvind Rameshwar, Navin Kashyap
2020	J	`jnl`	Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. CoRR V Arvind Rameshwar, Navin Kashyap
2020	J	`jnl`	How many modes can a constrained Gaussian mixture have? CoRR Navin Kashyap, Manjunath Krishnapur
2020	C	`conf`	On the Capacity of the Flash Memory Channel with Feedback. ISITA V Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap
2020	J	`jnl`	Probabilistic Forwarding of Coded Packets on Networks. CoRR B. R. Vinay Kumar, Navin Kashyap
2020	B	`conf`	Secure Information Exchange for Omniscience. ISIT Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
2019	J	`jnl`	Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values. CoRR V Arvind Rameshwar, Navin Kashyap
2019	—	`conf`	Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. NCC V Arvind Rameshwar, Navin Kashyap
2019	B	`conf`	Computable Upper Bounds for Unifilar Finite-State Channels. ISIT Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz
2019	J	`jnl`	Computable Upper Bounds on the Capacity of Finite-State Channels. CoRR Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai
2019	B	`conf`	One-Shot Perfect Secret Key Agreement for Finite Linear Sources. ISIT Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
2019	J	`jnl`	One-Shot Perfect Secret Key Agreement for Finite Linear Sources. CoRR Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
2019	B	`conf`	Probabilistic Forwarding of Coded Packets on Networks. ISIT B. R. Vinay Kumar, Navin Kashyap
2019	J	`jnl`	Probabilistic Forwarding of Coded Packets on Networks. CoRR B. R. Vinay Kumar, Navin Kashyap
2019	B	`conf`	The Capacity of Count-Constrained ICI-Free Systems. ISIT Navin Kashyap, Ron M. Roth, Paul H. Siegel
2019	J	`jnl`	The Capacity of Count-Constrained ICI-Free Systems. CoRR Navin Kashyap, Ron M. Roth, Paul H. Siegel
2019	J	`jnl`	The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol. CoRR B. R. Vinay Kumar, Roshan Antony, Navin Kashyap
2019	J	`jnl`	The Lattice Structure of Linear Subspace Codes. CoRR Pranab Basu, Navin Kashyap
2019	J	`jnl`	Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. IEEE Trans. Inf. Theory Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2018	J	`jnl`	Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. IEEE Trans. Inf. Theory Oron Sabag, Haim H. Permuter, Navin Kashyap
2018	B	`conf`	Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. ISIT Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2018	J	`jnl`	Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. CoRR Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2018	C	`conf`	On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. ISITA Shivkumar K. Manickam, Navin Kashyap
2018	J	`jnl`	On the Optimality of Secret Key Agreement via Omniscience. IEEE Trans. Inf. Theory Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2018	J	`jnl`	Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. CoRR Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2017	—	`conf`	A maximization problem related to Huffman codes. NCC K. Manickam Shivkumar, Navin Kashyap
2017	B	`conf`	An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. ISIT Oron Sabag, Haim H. Permuter, Navin Kashyap
2017	J	`jnl`	Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint. CoRR Oron Sabag, Haim H. Permuter, Navin Kashyap
2017	J	`jnl`	On the Optimality of Secret Key Agreement via Omniscience. CoRR Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2017	J	`jnl`	Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation. SIAM J. Discret. Math. Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur
2017	J	`jnl`	Secret Key Agreement under Discussion Rate Constraints. CoRR Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2017	B	`conf`	Secret key agreement under discussion rate constraints. ISIT Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2017	J	`jnl`	Some "goodness" properties of LDA lattices. Probl. Inf. Transm. Shashank Vatedka, Navin Kashyap
2016	J	`jnl`	A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. CoRR Shashank Vatedka, Navin Kashyap
2016	J	`jnl`	A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. CoRR Shashank Vatedka, Navin Kashyap
2016	B	`conf`	A lattice coding scheme for secret key generation from Gaussian Markov tree sources. ISIT Shashank Vatedka, Navin Kashyap
2016	J	`jnl`	Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. CoRR Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2016	B	`conf`	Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. ISIT Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
2016	J	`jnl`	MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium. IEEE J. Sel. Areas Commun. N. V. Abhinav Das, Navin Kashyap
2016	J	`jnl`	On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. IEEE Trans. Inf. Theory Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
2016	J	`jnl`	The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. IEEE Trans. Inf. Theory Oron Sabag, Haim H. Permuter, Navin Kashyap
2016	—	`conf`	The feedback capacity of the BIBO channel with a no-consecutive-ones input constraint. SPCOM Oron Sabag, Haim H. Permuter, Navin Kashyap
2016	B	`conf`	When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
2015	B	`conf`	Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. ITW Oron Sabag, Haim H. Permuter, Navin Kashyap
2015	B	`conf`	Generalized belief propagation for estimating the partition function of the 2D Ising model. ISIT Chun Lam Chan, Mahdi Jafari Siavoshani, Sidharth Jaggi, Navin Kashyap, Pascal O. Vontobel
2015	J	`jnl`	Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains. CoRR Shashank Vatedka, Navin Kashyap
2015	B	`conf`	Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. ITW Shashank Vatedka, Navin Kashyap
2015	—	`conf`	On linear subspace codes closed under intersection. NCC Pranab Basu, Navin Kashyap
2015	J	`jnl`	On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. CoRR Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
2015	J	`jnl`	Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation. CoRR Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur
2015	J	`jnl`	Secure Compute-and-Forward in a Bidirectional Relay. IEEE Trans. Inf. Theory Shashank Vatedka, Navin Kashyap, Andrew Thangaraj
2015	B	`conf`	Some "goodness" properties of LDA lattices. ITW Shashank Vatedka, Navin Kashyap
2015	J	`jnl`	The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel. CoRR Oron Sabag, Haim H. Permuter, Navin Kashyap
2015	B	`conf`	The communication complexity of achieving SK capacity in a class of PIN models. ISIT Manuj Mukherjee, Navin Kashyap
2015	J	`jnl`	The communication complexity of achieving SK capacity in a class of PIN models. CoRR Manuj Mukherjee, Navin Kashyap
2015	—	`conf`	The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. Allerton Oron Sabag, Haim H. Permuter, Navin Kashyap
2014	J	`jnl`	Achieving SK Capacity in the Source Model: When Must All Terminals Talk? CoRR Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
2014	B	`conf`	Achieving SK capacity in the source model: When must all terminals talk? ISIT Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
2014	J	`jnl`	On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. CoRR Manuj Mukherjee, Navin Kashyap
2014	B	`conf`	On the communication complexity of secret key generation in the multiterminal source model. ISIT Manuj Mukherjee, Navin Kashyap
2014	J	`jnl`	Some "Goodness" Properties of LDA Lattices. CoRR Shashank Vatedka, Navin Kashyap
2014	J	`jnl`	Upper Bounds on the Size of Grain-Correcting Codes. IEEE Trans. Inf. Theory Navin Kashyap, Gilles Zémor
2013	B	`conf`	A phase transition for the uniform distribution in the pattern maximum likelihood problem. ITW Winston Fernandes, Navin Kashyap
2013	B	`conf`	Lattice coding for strongly secure compute-and-forward in a bidirectional relay. ISIT V. Shashank, Navin Kashyap
2013	B	`conf`	On 2-D non-adjacent-error channel models. ITW K. Manickam Shivkumar, Navin Kashyap
2013	J	`jnl`	On the Zeta Function of a Periodic-Finite-Type Shift. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Akiko Manada, Navin Kashyap
2013	J	`jnl`	Upper Bounds on the Size of Grain-Correcting Codes CoRR Navin Kashyap, Gilles Zémor
2013	B	`conf`	Upper bounds on the size of grain-correcting codes. ISIT Navin Kashyap, Gilles Zémor
2012	B	`conf`	Fault-tolerant secret key generation. ISIT Himanshu Tyagi, Navin Kashyap, Yogesh Sankarasubramaniam, Kapali Viswanathan
2012	J	`jnl`	Secure Compute-and-Forward in a Bidirectional Relay CoRR Navin Kashyap, V. Shashank, Andrew Thangaraj
2012	B	`conf`	Secure computation in a bidirectional relay. ISIT Navin Kashyap, V. Shashank, Andrew Thangaraj
2012	J	`jnl`	The Treewidth of MDS and Reed-Muller Codes. IEEE Trans. Inf. Theory Navin Kashyap, Andrew Thangaraj
2011	J	`jnl`	Coding for High-Density Recording on a 1-D Granular Magnetic Medium. IEEE Trans. Inf. Theory Arya Mazumdar, Alexander Barg, Navin Kashyap
2011	J	`jnl`	On the Treewidth of MDS and Reed-Muller Codes CoRR Navin Kashyap, Andrew Thangaraj
2011	B	`conf`	On the treewidth of MDS and Reed-Muller codes. ISIT Navin Kashyap, Andrew Thangaraj
2011	J	`jnl`	The effect of malformed tiles on tile assemblies within the kinetic tile assembly model. Nat. Comput. Ya Meng, Navin Kashyap
2010	B	`conf`	A graphical model for computing the minimum cost transposition distance. ITW Farzad Farnoud, Chien-Yu Chen, Olgica Milenkovic, Navin Kashyap
2010	J	`jnl`	Coding for High-Density Recording on a 1-D Granular Magnetic Medium CoRR Arya Mazumdar, Alexander Barg, Navin Kashyap
2010	B	`conf`	Coding for high-density magnetic recording. ISIT Arya Mazumdar, Alexander Barg, Navin Kashyap
2010	—	`conf`	On the capacity of high-density recording on a 1-D granular magnetic medium. Allerton Arya Mazumdar, Alexander Barg, Navin Kashyap
2009	J	`jnl`	A Comparative Study of Periods in a Periodic-Finite-Type Shift. SIAM J. Discret. Math. Akiko Manada, Navin Kashyap
2009	J	`jnl`	Constraint complexity of realizations of linear codes on arbitrary graphs. IEEE Trans. Inf. Theory Navin Kashyap
2009	—	`conf`	Controlling errors in the process of molecular self-assembly. Allerton Ya Meng, Navin Kashyap
2009	J	`jnl`	Data Synchronization With Timing: The Variable-Rate Case. IEEE Trans. Inf. Theory Navin Kashyap, David L. Neuhoff
2009	J	`jnl`	On minimal tree realizations of linear codes. IEEE Trans. Inf. Theory Navin Kashyap
2009	B	`conf`	The Effect of Malformed Tiles on Tile Assemblies within kTAM. DNA Ya Meng, Navin Kashyap
2009	J	`jnl`	The Zeta Function of a Periodic-Finite-Type Shift CoRR Akiko Manada, Navin Kashyap
2009	B	`conf`	The zeta function of a periodic-finite-type shift. ISIT Navin Kashyap, Akiko Manada
2008	J	`jnl`	A Decomposition Theory for Binary Linear Codes. IEEE Trans. Inf. Theory Navin Kashyap
2008	J	`jnl`	Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs CoRR Navin Kashyap
2008	J	`jnl`	LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel. IEEE Commun. Lett. Adam Cohen, Fady Alajaji, Navin Kashyap, Glen Takahara
2008	J	`jnl`	Matroid Pathwidth and Code Trellis Complexity. SIAM J. Discret. Math. Navin Kashyap
2008	J	`jnl`	On the Period of a Periodic-Finite-Type Shift CoRR Akiko Manada, Navin Kashyap
2008	B	`conf`	On the period of a periodic-finite-type shift. ISIT Akiko Manada, Navin Kashyap
2007	B	`conf`	Code Decomposition: Theory and Applications. ISIT Navin Kashyap
2007	J	`jnl`	Matroid Pathwidth and Code Trellis Complexity CoRR Navin Kashyap
2007	J	`jnl`	On Minimal Tree Realizations of Linear Codes CoRR Navin Kashyap
2007	—	`conf`	The "Art of Trellis Decoding" Is NP-Hard. AAECC Navin Kashyap
2006	J	`jnl`	A Decomposition Theory for Binary Linear Codes CoRR Navin Kashyap
2006	J	`jnl`	Coding for the optical channel: the ghost-pulse constraint. IEEE Trans. Inf. Theory Navin Kashyap, Paul H. Siegel, Alexander Vardy
2006	J	`jnl`	On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type CoRR Akiko Manada, Navin Kashyap
2006	B	`conf`	On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type. ISIT Akiko Manada, Navin Kashyap
2006	J	`jnl`	Periodic prefix-synchronized codes: A generating function approach. IEEE Trans. Inf. Theory Navin Kashyap, David L. Neuhoff
2006	J	`jnl`	Shortened Array Codes of Large Girth. IEEE Trans. Inf. Theory Olgica Milenkovic, Navin Kashyap, David Leyba
2005	J	`jnl`	An Application of Ramsey Theory to Coding for the Optical Channel. SIAM J. Discret. Math. Navin Kashyap, Paul H. Siegel, Alexander Vardy
2005	J	`jnl`	Coding for the Optical Channel: the Ghost-Pulse Constraint CoRR Navin Kashyap, Paul H. Siegel, Alexander Vardy
2005	J	`jnl`	DNA Codes that Avoid Secondary Structures CoRR Olgica Milenkovic, Navin Kashyap
2005	B	`conf`	DNA codes that avoid secondary structures. ISIT Olgica Milenkovic, Navin Kashyap
2005	—	`conf`	On DNA Computers Controlling Gene Expression Levels. CDC/ECC Olgica Milenkovic, Navin Kashyap, Bane Vasic
2005	—	`conf`	On the Design of Codes for DNA Computing. WCC Olgica Milenkovic, Navin Kashyap
2005	J	`jnl`	Shortened Array Codes of Large Girth CoRR Olgica Milenkovic, Navin Kashyap, David Leyba
2004	B	`conf`	A Ramsey theory approach to ghostbusting. ISIT Navin Kashyap, Paul H. Siegel, Alexander Vardy
2004	—	`conf`	Ghostbusting: Coding for Optical Communications. Advances in Information Recording Navin Kashyap, Paul H. Siegel
2004	J	`jnl`	Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity. IEEE Trans. Inf. Theory Navin Kashyap, Paul H. Siegel
2004	B	`conf`	Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity. ISIT Navin Kashyap, Paul H. Siegel
2003	J	`jnl`	Equalities among Capacities of (d, k)-Constrained Systems. SIAM J. Discret. Math. Navin Kashyap, Paul H. Siegel
2003	J	`jnl`	Maximizing the Shannon Capacity of Constrained Systems with Two Constraints. SIAM J. Discret. Math. Navin Kashyap
2001	J	`jnl`	Data synchronization with timing. IEEE Trans. Inf. Theory Navin Kashyap, David L. Neuhoff
2001	J	`jnl`	On quantization with the Weaire-Phelan partition. IEEE Trans. Inf. Theory Navin Kashyap, David L. Neuhoff
1999	B	`conf`	Codes for Data Synchronization with Timing. Data Compression Conference Navin Kashyap, David L. Neuhoff