default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNavin Kashyap
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[i58]Shiv Pratap Singh Rathore, Navin Kashyap:
Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics. CoRR abs/2501.11393 (2025)- 2024
- [j39]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): 5289-5308 (2024) - [c67]Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap:
Sequentially Encodable Codeword Stabilized Codes. ISIT (Workshops) 2024: 1-6 - [c66]Shreyas Jain, V Arvind Rameshwar, Navin Kashyap:
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. ISIT 2024: 280-285 - [c65]Prachi Mishra, Navin Kashyap:
Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. ISIT 2024: 1251-1256 - [c64]Daanish Mahajan, Chirag Jain, Navin Kashyap:
On the Coverage Required for Diploid Genome Assembly. ISIT 2024: 3636-3641 - [c63]V Arvind Rameshwar, Shreyas Jain, Navin Kashyap:
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. NCC 2024: 1-6 - [i57]Shreyas Jain, V Arvind Rameshwar, Navin Kashyap:
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. CoRR abs/2403.05893 (2024) - [i56]Prachi Mishra, Navin Kashyap:
Error-Resilient Weakly Constrained Coding via Row-by-Row Coding. CoRR abs/2404.18469 (2024) - [i55]Daanish Mahajan, Chirag Jain, Navin Kashyap:
On the Coverage Required for Diploid Genome Assembly. CoRR abs/2405.05734 (2024) - [i54]Sowrabh Sudevan, Sourin Das, Thamadathil Aswanth, Navin Kashyap:
Sequentially Encodable Codeword Stabilized Codes. CoRR abs/2405.06142 (2024) - 2023
- [j38]V Arvind Rameshwar, Navin Kashyap:
Estimating the Sizes of Binary Error-Correcting Constrained Codes. IEEE J. Sel. Areas Inf. Theory 4: 144-158 (2023) - [j37]B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran:
An analysis of probabilistic forwarding of coded packets on random geometric graphs. Perform. Evaluation 160: 102343 (2023) - [j36]Praneeth Kumar Vippathalla, Navin Kashyap:
The Secure Storage Capacity of a DNA Wiretap Channel Model. IEEE Trans. Inf. Theory 69(9): 5550-5569 (2023) - [j35]V Arvind Rameshwar, Navin Kashyap:
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. IEEE Trans. Inf. Theory 69(11): 7003-7024 (2023) - [j34]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement via Secure Omniscience. IEEE Trans. Inf. Theory 69(12): 8029-8053 (2023) - [c62]V Arvind Rameshwar, Navin Kashyap:
A Version of Delsarte's Linear Program for Constrained Systems. ISIT 2023: 30-35 - [c61]V Arvind Rameshwar, Navin Kashyap:
Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. ISIT 2023: 2667-2672 - [i53]V Arvind Rameshwar, Navin Kashyap:
Estimating the Sizes of Binary Error-Correcting Constrained Codes. CoRR abs/2301.05098 (2023) - [i52]V Arvind Rameshwar, Shreyas Jain, Navin Kashyap:
Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. CoRR abs/2309.08907 (2023) - 2022
- [c60]Tania Sidana, Navin Kashyap:
Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. ISIT 2022: 1064-1069 - [c59]V Arvind Rameshwar, Navin Kashyap:
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. ISIT 2022: 1755-1760 - [c58]Praneeth Kumar Vippathalla, Navin Kashyap:
The Secure Storage Capacity of a DNA Wiretap Channel Model. ISIT 2022: 1785-1790 - [c57]V Arvind Rameshwar, Navin Kashyap:
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. ITW 2022: 624-629 - [c56]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. ITW 2022: 726-731 - [c55]V Arvind Rameshwar, Navin Kashyap:
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. SPCOM 2022: 1-5 - [i51]V Arvind Rameshwar, Navin Kashyap:
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. CoRR abs/2201.02035 (2022) - [i50]Praneeth Kumar Vippathalla, Navin Kashyap:
The Secure Storage Capacity of a DNA Wiretap Channel Model. CoRR abs/2201.05995 (2022) - [i49]Tania Sidana, Navin Kashyap:
Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. CoRR abs/2202.00248 (2022) - [i48]V Arvind Rameshwar, Navin Kashyap:
A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR abs/2204.06780 (2022) - [i47]V Arvind Rameshwar, Navin Kashyap:
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. CoRR abs/2205.04153 (2022) - [i46]V Arvind Rameshwar, Navin Kashyap:
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. CoRR abs/2211.05513 (2022) - 2021
- [j33]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): 278-290 (2021) - [j32]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): 5674-5692 (2021) - [j31]B. R. Vinay Kumar, Navin Kashyap:
Probabilistic Forwarding of Coded Packets on Networks. IEEE/ACM Trans. Netw. 29(1): 234-247 (2021) - [c54]V Arvind Rameshwar, Navin Kashyap:
Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel. ISIT 2021: 290-295 - [c53]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. ISIT 2021: 1624-1629 - [c52]Anand Jerry George, Navin Kashyap:
An MCMC Method to Sample from Lattice Distributions. ISIT 2021: 3074-3079 - [c51]B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran:
An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. WiOpt 2021: 9-16 - [i45]Anand Jerry George, Navin Kashyap:
An MCMC Method to Sample from Lattice Distributions. CoRR abs/2101.06453 (2021) - [i44]V Arvind Rameshwar, Navin Kashyap:
Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. CoRR abs/2101.08638 (2021) - [i43]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. CoRR abs/2102.01771 (2021) - [i42]B. R. Vinay Kumar, Navin Kashyap, D. Yogeshwaran:
An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs. CoRR abs/2105.08779 (2021) - [i41]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Wiretap Secret Key Agreement Via Secure Omniscience. CoRR abs/2112.00394 (2021) - 2020
- [c50]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Secure Information Exchange for Omniscience. ISIT 2020: 966-971 - [c49]V Arvind Rameshwar, Navin Kashyap:
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. ISIT 2020: 2002-2007 - [c48]V Arvind Rameshwar, Aryabhatt M. Reghu, Navin Kashyap:
On the Capacity of the Flash Memory Channel with Feedback. ISITA 2020: 11-15 - [i40]V Arvind Rameshwar, Navin Kashyap:
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. CoRR abs/2001.03423 (2020) - [i39]B. R. Vinay Kumar, Navin Kashyap:
Probabilistic Forwarding of Coded Packets on Networks. CoRR abs/2002.04438 (2020) - [i38]Navin Kashyap, Manjunath Krishnapur:
How many modes can a constrained Gaussian mixture have? CoRR abs/2005.01580 (2020)
2010 – 2019
- 2019
- [j30]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): 5080-5093 (2019) - [c47]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. ISIT 2019: 947-951 - [c46]Navin Kashyap, Ron M. Roth, Paul H. Siegel:
The Capacity of Count-Constrained ICI-Free Systems. ISIT 2019: 1592-1596 - [c45]Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz:
Computable Upper Bounds for Unifilar Finite-State Channels. ISIT 2019: 1892-1896 - [c44]B. R. Vinay Kumar, Navin Kashyap:
Probabilistic Forwarding of Coded Packets on Networks. ISIT 2019: 1952-1956 - [c43]V Arvind Rameshwar, Navin Kashyap:
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. NCC 2019: 1-6 - [i37]B. R. Vinay Kumar, Roshan Antony, Navin Kashyap:
The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol. CoRR abs/1901.02033 (2019) - [i36]Navin Kashyap, Ron M. Roth, Paul H. Siegel:
The Capacity of Count-Constrained ICI-Free Systems. CoRR abs/1901.03261 (2019) - [i35]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. CoRR abs/1901.05817 (2019) - [i34]B. R. Vinay Kumar, Navin Kashyap:
Probabilistic Forwarding of Coded Packets on Networks. CoRR abs/1901.07498 (2019) - [i33]V Arvind Rameshwar, Navin Kashyap:
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values. CoRR abs/1902.09865 (2019) - [i32]Pranab Basu, Navin Kashyap:
The Lattice Structure of Linear Subspace Codes. CoRR abs/1911.00721 (2019) - [i31]Bashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai:
Computable Upper Bounds on the Capacity of Finite-State Channels. CoRR abs/1911.02113 (2019) - 2018
- [j29]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. IEEE Trans. Inf. Theory 64(4): 2371-2389 (2018) - [j28]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): 4940-4961 (2018) - [c42]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. ISIT 2018: 2654-2658 - [c41]Shivkumar K. Manickam, Navin Kashyap:
On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. ISITA 2018: 648-652 - [i30]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. CoRR abs/1802.04955 (2018) - [i29]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. CoRR abs/1805.01115 (2018) - 2017
- [j27]Shashank Vatedka, Navin Kashyap:
Some "goodness" properties of LDA lattices. Probl. Inf. Transm. 53(1): 1-29 (2017) - [j26]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): 597-631 (2017) - [c40]Oron Sabag, Haim H. Permuter, Navin Kashyap:
An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. ISIT 2017: 216-220 - [c39]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret key agreement under discussion rate constraints. ISIT 2017: 1519-1523 - [c38]K. Manickam Shivkumar, Navin Kashyap:
A maximization problem related to Huffman codes. NCC 2017: 1-6 - [i28]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement under Discussion Rate Constraints. CoRR abs/1701.05008 (2017) - [i27]Oron Sabag, Haim H. Permuter, Navin Kashyap:
Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint. CoRR abs/1701.06174 (2017) - [i26]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. CoRR abs/1702.07429 (2017) - 2016
- [j25]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): 2430-2438 (2016) - [j24]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): 8-22 (2016) - [j23]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): 3811-3830 (2016) - [c37]Shashank Vatedka, Navin Kashyap:
A lattice coding scheme for secret key generation from Gaussian Markov tree sources. ISIT 2016: 515-519 - [c36]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: 2504-2508 - [c35]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW 2016: 354-358 - [c34]Oron Sabag, Haim H. Permuter, Navin Kashyap:
The feedback capacity of the BIBO channel with a no-consecutive-ones input constraint. SPCOM 2016: 1-5 - [i25]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. CoRR abs/1601.05377 (2016) - [i24]Shashank Vatedka, Navin Kashyap:
A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. CoRR abs/1601.05868 (2016) - [i23]Shashank Vatedka, Navin Kashyap:
A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. CoRR abs/1603.08236 (2016) - 2015
- [j22]Shashank Vatedka, Navin Kashyap, Andrew Thangaraj:
Secure Compute-and-Forward in a Bidirectional Relay. IEEE Trans. Inf. Theory 61(5): 2531-2556 (2015) - [c33]Oron Sabag, Haim H. Permuter, Navin Kashyap:
The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. Allerton 2015: 160-164 - [c32]Manuj Mukherjee, Navin Kashyap:
The communication complexity of achieving SK capacity in a class of PIN models. ISIT 2015: 296-300 - [c31]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: 2261-2265 - [c30]Oron Sabag, Haim H. Permuter, Navin Kashyap:
Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. ITW 2015: 1-5 - [c29]Shashank Vatedka, Navin Kashyap:
Some "goodness" properties of LDA lattices. ITW 2015: 1-5 - [c28]Shashank Vatedka, Navin Kashyap:
Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. ITW 2015: 1-5 - [c27]Pranab Basu, Navin Kashyap:
On linear subspace codes closed under intersection. NCC 2015: 1-6 - [i22]Oron Sabag, Haim H. Permuter, Navin Kashyap:
The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel. CoRR abs/1503.03359 (2015) - [i21]Manuj Mukherjee, Navin Kashyap:
The communication complexity of achieving SK capacity in a class of PIN models. CoRR abs/1504.00629 (2015) - [i20]Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur:
Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation. CoRR abs/1506.00753 (2015) - [i19]Shashank Vatedka, Navin Kashyap:
Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains. CoRR abs/1506.02152 (2015) - [i18]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. CoRR abs/1507.02874 (2015) - 2014
- [j21]Navin Kashyap, Gilles Zémor:
Upper Bounds on the Size of Grain-Correcting Codes. IEEE Trans. Inf. Theory 60(8): 4699-4709 (2014) - [c26]Manuj Mukherjee, Navin Kashyap:
On the communication complexity of secret key generation in the multiterminal source model. ISIT 2014: 1151-1155 - [c25]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
Achieving SK capacity in the source model: When must all terminals talk? ISIT 2014: 1156-1160 - [i17]Manuj Mukherjee, Navin Kashyap:
On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. CoRR abs/1401.1117 (2014) - [i16]Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
Achieving SK Capacity in the Source Model: When Must All Terminals Talk? CoRR abs/1401.5037 (2014) - [i15]Shashank Vatedka, Navin Kashyap:
Some "Goodness" Properties of LDA Lattices. CoRR abs/1410.7619 (2014) - 2013
- [j20]Akiko Manada, Navin Kashyap:
On the Zeta Function of a Periodic-Finite-Type Shift. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1024-1031 (2013) - [c24]Navin Kashyap, Gilles Zémor:
Upper bounds on the size of grain-correcting codes. ISIT 2013: 136-140 - [c23]V. Shashank, Navin Kashyap:
Lattice coding for strongly secure compute-and-forward in a bidirectional relay. ISIT 2013: 2775-2779 - [c22]Winston Fernandes, Navin Kashyap:
A phase transition for the uniform distribution in the pattern maximum likelihood problem. ITW 2013: 1-5 - [c21]K. Manickam Shivkumar, Navin Kashyap:
On 2-D non-adjacent-error channel models. ITW 2013: 1-5 - [i14]Navin Kashyap, Gilles Zémor:
Upper Bounds on the Size of Grain-Correcting Codes. CoRR abs/1302.6154 (2013) - 2012
- [j19]Navin Kashyap, Andrew Thangaraj:
The Treewidth of MDS and Reed-Muller Codes. IEEE Trans. Inf. Theory 58(7): 4837-4847 (2012) - [c20]Navin Kashyap, V. Shashank, Andrew Thangaraj:
Secure computation in a bidirectional relay. ISIT 2012: 1162-1166 - [c19]Himanshu Tyagi, Navin Kashyap, Yogesh Sankarasubramaniam, Kapali Viswanathan:
Fault-tolerant secret key generation. ISIT 2012: 1787-1791 - [i13]Navin Kashyap, V. Shashank, Andrew Thangaraj:
Secure Compute-and-Forward in a Bidirectional Relay. CoRR abs/1206.3392 (2012) - 2011
- [j18]Ya Meng, Navin Kashyap:
The effect of malformed tiles on tile assemblies within the kinetic tile assembly model. Nat. Comput. 10(1): 357-373 (2011) - [j17]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for High-Density Recording on a 1-D Granular Magnetic Medium. IEEE Trans. Inf. Theory 57(11): 7403-7417 (2011) - [c18]Navin Kashyap, Andrew Thangaraj:
On the treewidth of MDS and Reed-Muller codes. ISIT 2011: 1925-1929 - [i12]Navin Kashyap, Andrew Thangaraj:
On the Treewidth of MDS and Reed-Muller Codes. CoRR abs/1102.2734 (2011) - 2010
- [c17]Arya Mazumdar, Alexander Barg, Navin Kashyap:
On the capacity of high-density recording on a 1-D granular magnetic medium. Allerton 2010: 368-375 - [c16]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for high-density magnetic recording. ISIT 2010: 978-982 - [c15]Farzad Farnoud, Chien-Yu Chen, Olgica Milenkovic, Navin Kashyap:
A graphical model for computing the minimum cost transposition distance. ITW 2010: 1-5 - [i11]Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for High-Density Recording on a 1-D Granular Magnetic Medium. CoRR abs/1012.1895 (2010)
2000 – 2009
- 2009
- [j16]Akiko Manada, Navin Kashyap:
A Comparative Study of Periods in a Periodic-Finite-Type Shift. SIAM J. Discret. Math. 23(3): 1507-1524 (2009) - [j15]Navin Kashyap, David L. Neuhoff:
Data Synchronization With Timing: The Variable-Rate Case. IEEE Trans. Inf. Theory 55(1): 46-52 (2009) - [j14]Navin Kashyap:
On minimal tree realizations of linear codes. IEEE Trans. Inf. Theory 55(8): 3501-3519 (2009) - [j13]Navin Kashyap:
Constraint complexity of realizations of linear codes on arbitrary graphs. IEEE Trans. Inf. Theory 55(11): 4864-4877 (2009) - [c14]Ya Meng, Navin Kashyap:
Controlling errors in the process of molecular self-assembly. Allerton 2009: 676-677 - [c13]Ya Meng, Navin Kashyap:
The Effect of Malformed Tiles on Tile Assemblies within kTAM. DNA 2009: 116-125 - [c12]Navin Kashyap, Akiko Manada:
The zeta function of a periodic-finite-type shift. ISIT 2009: 1569-1573 - [i10]Akiko Manada, Navin Kashyap:
The Zeta Function of a Periodic-Finite-Type Shift. CoRR abs/0904.2375 (2009) - 2008
- [j12]Adam Cohen, Fady Alajaji, Navin Kashyap, Glen Takahara:
LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel. IEEE Commun. Lett. 12(9): 678-680 (2008) - [j11]Navin Kashyap:
Matroid Pathwidth and Code Trellis Complexity. SIAM J. Discret. Math. 22(1): 256-272 (2008) - [j10]Navin Kashyap:
A Decomposition Theory for Binary Linear Codes. IEEE Trans. Inf. Theory 54(7): 3035-3058 (2008) - [c11]Akiko Manada, Navin Kashyap:
On the period of a periodic-finite-type shift. ISIT 2008: 1453-1457 - [i9]Akiko Manada, Navin Kashyap:
On the Period of a Periodic-Finite-Type Shift. CoRR abs/0801.1060 (2008) - [i8]Navin Kashyap:
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs. CoRR abs/0805.2199 (2008) - 2007
- [c10]Navin Kashyap:
The "Art of Trellis Decoding" Is NP-Hard. AAECC 2007: 198-207 - [c9]Navin Kashyap:
Code Decomposition: Theory and Applications. ISIT 2007: 481-485 - [i7]Navin Kashyap:
Matroid Pathwidth and Code Trellis Complexity. CoRR abs/0705.1384 (2007) - [i6]Navin Kashyap:
On Minimal Tree Realizations of Linear Codes. CoRR abs/0711.1383 (2007) - 2006
- [j9]Navin Kashyap, Paul H. Siegel, Alexander Vardy:
Coding for the optical channel: the ghost-pulse constraint. IEEE Trans. Inf. Theory 52(1): 64-77 (2006) - [j8]Navin Kashyap, David L. Neuhoff:
Periodic prefix-synchronized codes: A generating function approach. IEEE Trans. Inf. Theory 52(2): 538-548 (2006) - [j7]Olgica Milenkovic, Navin Kashyap, David Leyba:
Shortened Array Codes of Large Girth. IEEE Trans. Inf. Theory 52(8): 3707-3722 (2006) - [c8]Akiko Manada, Navin Kashyap:
On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type. ISIT 2006: 1477-1481 - [i5]Akiko Manada, Navin Kashyap:
On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type. CoRR abs/cs/0604104 (2006) - [i4]Navin Kashyap:
A Decomposition Theory for Binary Linear Codes. CoRR abs/cs/0611028 (2006) - 2005
- [j6]Navin Kashyap, Paul H. Siegel, Alexander Vardy:
An Application of Ramsey Theory to Coding for the Optical Channel. SIAM J. Discret. Math. 19(4): 921-937 (2005) - [c7]Olgica Milenkovic, Navin Kashyap, Bane Vasic:
On DNA Computers Controlling Gene Expression Levels. CDC/ECC 2005: 1770-1775 - [c6]Olgica Milenkovic, Navin Kashyap:
DNA codes that avoid secondary structures. ISIT 2005: 288-292 - [c5]Olgica Milenkovic, Navin Kashyap:
On the Design of Codes for DNA Computing. WCC 2005: 100-119 - [i3]Olgica Milenkovic, Navin Kashyap, David Leyba:
Shortened Array Codes of Large Girth. CoRR abs/cs/0504016 (2005) - [i2]Olgica Milenkovic, Navin Kashyap:
DNA Codes that Avoid Secondary Structures. CoRR abs/cs/0508055 (2005) - [i1]Navin Kashyap, Paul H. Siegel, Alexander Vardy:
Coding for the Optical Channel: the Ghost-Pulse Constraint. CoRR abs/cs/0510033 (2005) - 2004
- [j5]Navin Kashyap, Paul H. Siegel:
Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity. IEEE Trans. Inf. Theory 50(6): 1327-1331 (2004) - [c4]Navin Kashyap, Paul H. Siegel:
Ghostbusting: Coding for Optical Communications. Advances in Information Recording 2004: 147-162 - [c3]Navin Kashyap, Paul H. Siegel:
Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity. ISIT 2004: 87 - [c2]Navin Kashyap, Paul H. Siegel, Alexander Vardy:
A Ramsey theory approach to ghostbusting. ISIT 2004: 190 - 2003
- [j4]Navin Kashyap, Paul H. Siegel:
Equalities among Capacities of (d, k)-Constrained Systems. SIAM J. Discret. Math. 17(2): 276-297 (2003) - [j3]Navin Kashyap:
Maximizing the Shannon Capacity of Constrained Systems with Two Constraints. SIAM J. Discret. Math. 17(2): 298-319 (2003) - 2001
- [j2]Navin Kashyap, David L. Neuhoff:
Data synchronization with timing. IEEE Trans. Inf. Theory 47(4): 1444-1460 (2001) - [j1]Navin Kashyap, David L. Neuhoff:
On quantization with the Weaire-Phelan partition. IEEE Trans. Inf. Theory 47(6): 2538-2543 (2001)
1990 – 1999
- 1999
- [c1]Navin Kashyap, David L. Neuhoff:
Codes for Data Synchronization with Timing. Data Compression Conference 1999: 443-452
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
