Navin Kashyap

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 82

Top Venues

CoRR

ISIT

IEEE Trans. Inf. Theory

ITW

Publications

Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap
Sequentially Encodable Codeword Stabilized Codes. CoRR (2024)
V Arvind Rameshwar, Shreyas Jain, Navin Kashyap
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. NCC (2024)
Prachi Mishra, Navin Kashyap
Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. CoRR (2024)
Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap
Sequentially Encodable Codeword Stabilized Codes. ISIT (Workshops) (2024)
Yuwen Huang, Navin Kashyap, Pascal O. Vontobel
Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix. IEEE Trans. Inf. Theory 70 (7) (2024)
Daanish Mahajan, Chirag Jain, Navin Kashyap
On the Coverage Required for Diploid Genome Assembly. CoRR (2024)
Shreyas Jain, V Arvind Rameshwar, Navin Kashyap
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. CoRR (2024)
B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran
An analysis of probabilistic forwarding of coded packets on random geometric graphs. Perform. Evaluation 160 (2023)
V Arvind Rameshwar, Shreyas Jain, Navin Kashyap
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. CoRR (2023)
Praneeth Kumar Vippathalla, Navin Kashyap
The Secure Storage Capacity of a DNA Wiretap Channel Model. IEEE Trans. Inf. Theory 69 (9) (2023)
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Secret Key Agreement via Secure Omniscience. IEEE Trans. Inf. Theory 69 (12) (2023)
V Arvind Rameshwar, Navin Kashyap
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. IEEE Trans. Inf. Theory 69 (11) (2023)
V Arvind Rameshwar, Navin Kashyap
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. ISIT (2023)
V Arvind Rameshwar, Navin Kashyap
Estimating the Sizes of Binary Error-Correcting Constrained Codes. IEEE J. Sel. Areas Inf. Theory 4 (2023)
V Arvind Rameshwar, Navin Kashyap
Estimating the Sizes of Binary Error-Correcting Constrained Codes. CoRR (2023)
V Arvind Rameshwar, Navin Kashyap
A Version of Delsarte's Linear Program for Constrained Systems. ISIT (2023)
Praneeth Kumar Vippathalla, Navin Kashyap
The Secure Storage Capacity of a DNA Wiretap Channel Model. CoRR (2022)
V Arvind Rameshwar, Navin Kashyap
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. ITW (2022)
V. Arvind Rameshwar, Navin Kashyap
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. SPCOM (2022)
V. Arvind Rameshwar, Navin Kashyap
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. CoRR (2022)
V. Arvind Rameshwar, Navin Kashyap
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. ISIT (2022)
V. Arvind Rameshwar, Navin Kashyap
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR (2022)
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. ITW (2022)
V Arvind Rameshwar, Navin Kashyap
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. CoRR (2022)
Tania Sidana, Navin Kashyap
Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. CoRR (2022)
V. Arvind Rameshwar, Navin Kashyap
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. CoRR (2022)
Praneeth Kumar Vippathalla, Navin Kashyap
The Secure Storage Capacity of a DNA Wiretap Channel Model. ISIT (2022)
Tania Sidana, Navin Kashyap
Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. ISIT (2022)
V. Arvind Rameshwar, Navin Kashyap
Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel. ISIT (2021)
Anand Jerry George, Navin Kashyap
An MCMC Method to Sample from Lattice Distributions. ISIT (2021)
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. CoRR (2021)
B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran
An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. WiOpt (2021)
Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz
Computable Upper Bounds on the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 67 (9) (2021)
B. R. Vinay Kumar, Navin Kashyap
Probabilistic Forwarding of Coded Packets on Networks. IEEE/ACM Trans. Netw. 29 (1) (2021)
Haseen Rahman, Ankith Vinayachandran, Sibi Raj B. Pillai, Kumar Appaiah, Rahul Vaze, Navin Kashyap
Deadline Constrained Packet Scheduling in the Presence of an Energy Harvesting Jammer. IEEE Trans. Green Commun. Netw. 5 (1) (2021)
B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran
An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. CoRR (2021)
V. Arvind Rameshwar, Navin Kashyap
Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR (2021)
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. ISIT (2021)
Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Wiretap Secret Key Agreement Via Secure Omniscience. CoRR (2021)
Anand Jerry George, Navin Kashyap
An MCMC Method to Sample from Lattice Distributions. CoRR (2021)
Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
Secure Information Exchange for Omniscience. ISIT (2020)
V. Arvind Rameshwar, Navin Kashyap
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. CoRR (2020)
V. Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap
On the Capacity of the Flash Memory Channel with Feedback. ISITA (2020)
V. Arvind Rameshwar, Navin Kashyap
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. ISIT (2020)
B. R. Vinay Kumar, Navin Kashyap
Probabilistic Forwarding of Coded Packets on Networks. CoRR (2020)
Navin Kashyap, Manjunath Krishnapur
How many modes can a constrained Gaussian mixture have? CoRR (2020)
Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. CoRR (2019)
Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz
Computable Upper Bounds for Unifilar Finite-State Channels. ISIT (2019)
Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. ISIT (2019)
V. Arvind Rameshwar, Navin Kashyap
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. NCC (2019)
Pranab Basu, Navin Kashyap
The Lattice Structure of Linear Subspace Codes. CoRR (2019)
Navin Kashyap, Ron M. Roth, Paul H. Siegel
The Capacity of Count-Constrained ICI-Free Systems. ISIT (2019)
V. Arvind Rameshwar, Navin Kashyap
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values. CoRR (2019)
B. R. Vinay Kumar, Roshan Antony, Navin Kashyap
The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol. CoRR (2019)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. IEEE Trans. Inf. Theory 65 (8) (2019)
Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai
Computable Upper Bounds on the Capacity of Finite-State Channels. CoRR (2019)
Navin Kashyap, Ron M. Roth, Paul H. Siegel
The Capacity of Count-Constrained ICI-Free Systems. CoRR (2019)
B. R. Vinay Kumar, Navin Kashyap
Probabilistic Forwarding of Coded Packets on Networks. ISIT (2019)
B. R. Vinay Kumar, Navin Kashyap
Probabilistic Forwarding of Coded Packets on Networks. CoRR (2019)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. ISIT (2018)
Shivkumar K. Manickam, Navin Kashyap
On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. ISITA (2018)
Oron Sabag, Haim H. Permuter, Navin Kashyap
Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. IEEE Trans. Inf. Theory 64 (7) (2018)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. CoRR (2018)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
On the Optimality of Secret Key Agreement via Omniscience. IEEE Trans. Inf. Theory 64 (4) (2018)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. CoRR (2018)
Oron Sabag, Haim H. Permuter, Navin Kashyap
Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint. CoRR (2017)
Oron Sabag, Haim H. Permuter, Navin Kashyap
An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. ISIT (2017)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
Secret key agreement under discussion rate constraints. ISIT (2017)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
Secret Key Agreement under Discussion Rate Constraints. CoRR (2017)
Shashank Vatedka, Navin Kashyap
Some "goodness" properties of LDA lattices. Probl. Inf. Transm. 53 (1) (2017)
K. Manickam Shivkumar, Navin Kashyap
A maximization problem related to Huffman codes. NCC (2017)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
On the Optimality of Secret Key Agreement via Omniscience. CoRR (2017)
Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur
Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation. SIAM J. Discret. Math. 31 (1) (2017)
Shashank Vatedka, Navin Kashyap
A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. CoRR (2016)
Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. CoRR (2016)
Oron Sabag, Haim H. Permuter, Navin Kashyap
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. IEEE Trans. Inf. Theory 62 (1) (2016)
Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou
Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. ISIT (2016)
Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou
When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW (2016)
Shashank Vatedka, Navin Kashyap
A lattice coding scheme for secret key generation from Gaussian Markov tree sources. ISIT (2016)
Shashank Vatedka, Navin Kashyap
A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. CoRR (2016)
Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. IEEE Trans. Inf. Theory 62 (7) (2016)
N. V. Abhinav Das, Navin Kashyap
MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium. IEEE J. Sel. Areas Commun. 34 (9) (2016)
Chun Lam Chan, Mahdi Jafari Siavoshani, Sidharth Jaggi, Navin Kashyap, Pascal O. Vontobel
Generalized belief propagation for estimating the partition function of the 2D Ising model. ISIT (2015)
Manuj Mukherjee, Navin Kashyap
The communication complexity of achieving SK capacity in a class of PIN models. CoRR (2015)
Oron Sabag, Haim H. Permuter, Navin Kashyap
Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. ITW (2015)
Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. CoRR (2015)
Shashank Vatedka, Navin Kashyap
Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. ITW (2015)
Shashank Vatedka, Navin Kashyap, Andrew Thangaraj
Secure Compute-and-Forward in a Bidirectional Relay. IEEE Trans. Inf. Theory 61 (5) (2015)
Manuj Mukherjee, Navin Kashyap
The communication complexity of achieving SK capacity in a class of PIN models. ISIT (2015)
Oron Sabag, Haim H. Permuter, Navin Kashyap
The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. Allerton (2015)
Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur
Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation. CoRR (2015)
Shashank Vatedka, Navin Kashyap
Some "goodness" properties of LDA lattices. ITW (2015)
Shashank Vatedka, Navin Kashyap
Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains. CoRR (2015)
Pranab Basu, Navin Kashyap
On linear subspace codes closed under intersection. NCC (2015)
Oron Sabag, Haim H. Permuter, Navin Kashyap
The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel. CoRR (2015)
Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam
Achieving SK Capacity in the Source Model: When Must All Terminals Talk? CoRR (2014)
Shashank Vatedka, Navin Kashyap
Some "Goodness" Properties of LDA Lattices. CoRR (2014)
Manuj Mukherjee, Navin Kashyap
On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. CoRR (2014)
Navin Kashyap, Gilles Zémor
Upper Bounds on the Size of Grain-Correcting Codes. IEEE Trans. Inf. Theory 60 (8) (2014)
Manuj Mukherjee, Navin Kashyap
On the communication complexity of secret key generation in the multiterminal source model. ISIT (2014)

Navin Kashyap.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Navin Kashyap