Secure Compute-and-Forward in a Bidirectional Relay
Vatedka, Shashank, Kashyap, Navin, Thangaraj, Andrew
Published in IEEE transactions on information theory (01.05.2015)
Published in IEEE transactions on information theory (01.05.2015)
Get full text
Journal Article
The Secure Storage Capacity of a DNA Wiretap Channel Model
Vippathalla, Praneeth Kumar, Kashyap, Navin
Published in IEEE transactions on information theory (01.09.2023)
Published in IEEE transactions on information theory (01.09.2023)
Get full text
Journal Article
Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix
Huang, Yuwen, Kashyap, Navin, Vontobel, Pascal O.
Published in IEEE transactions on information theory (01.07.2024)
Published in IEEE transactions on information theory (01.07.2024)
Get full text
Journal Article
Secret Key Agreement via Secure Omniscience
Vippathalla, Praneeth Kumar, Chan, Chung, Kashyap, Navin, Zhou, Qiaoqiao
Published in IEEE transactions on information theory (01.12.2023)
Published in IEEE transactions on information theory (01.12.2023)
Get full text
Journal Article
On the Optimality of Secret Key Agreement via Omniscience
Chan, Chung, Mukherjee, Manuj, Kashyap, Navin, Zhou, Qiaoqiao
Published in IEEE transactions on information theory (01.04.2018)
Published in IEEE transactions on information theory (01.04.2018)
Get full text
Journal Article
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
Chan, Chung, Mukherjee, Manuj, Kashyap, Navin, Zhou, Qiaoqiao
Published in IEEE transactions on information theory (01.08.2019)
Published in IEEE transactions on information theory (01.08.2019)
Get full text
Journal Article
Coding Schemes Based on Reed-Muller Codes for (d,∞)-RLL Input-Constrained Channels
Arvind Rameshwar, V., Kashyap, Navin
Published in IEEE transactions on information theory (01.11.2023)
Published in IEEE transactions on information theory (01.11.2023)
Get full text
Journal Article
Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint
Sabag, Oron, Permuter, Haim H., Kashyap, Navin
Published in IEEE transactions on information theory (01.07.2018)
Published in IEEE transactions on information theory (01.07.2018)
Get full text
Journal Article
Computable Upper Bounds on the Capacity of Finite-State Channels
Huleihel, Bashar, Sabag, Oron, Permuter, Haim H., Kashyap, Navin, Shamai Shitz, Shlomo
Published in IEEE transactions on information theory (01.09.2021)
Published in IEEE transactions on information theory (01.09.2021)
Get full text
Journal Article
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
Sabag, Oron, Permuter, Haim H., Kashyap, Navin
Published in IEEE transactions on information theory (01.01.2016)
Published in IEEE transactions on information theory (01.01.2016)
Get full text
Journal Article
Upper Bounds on the Size of Grain-Correcting Codes
Get full text
Journal Article
Conference Proceeding