The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Navin Kashyap" ( http://dblp.L3S.de/Authors/Navin_Kashyap )

  Author page on DBLP  Author page in RDF  Community of Navin Kashyap in ASPL-2

Publication years (Num. hits)
1999-2005 (15) 2006-2008 (16) 2009-2012 (18) 2013-2015 (25) 2016-2017 (17) 2018-2019 (12)
Publication types (Num. hits)
article(64) inproceedings(39)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 104 publication records. Showing 103 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1B. R. Vinay Kumar, Navin Kashyap Probabilistic Forwarding of Coded Packets on Networks. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Navin Kashyap, Ron M. Roth, Paul H. Siegel The Capacity of Count-Constrained ICI-Free Systems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1V. Arvind Rameshwar, Navin Kashyap Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible $(n, k, d)$ Parameter Values. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou One-Shot Perfect Secret Key Agreement for Finite Linear Sources. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1B. R. Vinay Kumar, Roshan Antony, Navin Kashyap The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1V. Arvind Rameshwar, Navin Kashyap Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. Search on Bibsonomy NCC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou On the Optimality of Secret Key Agreement via Omniscience. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Shivkumar K. Manickam, Navin Kashyap On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. Search on Bibsonomy ISITA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. Search on Bibsonomy ISIT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou On the Optimality of Secret Key Agreement via Omniscience. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou Secret Key Agreement under Discussion Rate Constraints. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap Some "goodness" properties of LDA lattices. Search on Bibsonomy Probl. Inf. Transm. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1K. Manickam Shivkumar, Navin Kashyap A maximization problem related to Huffman codes. Search on Bibsonomy NCC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou Secret key agreement under discussion rate constraints. Search on Bibsonomy ISIT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint. Search on Bibsonomy ISIT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1N. V. Abhinav Das, Navin Kashyap MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. Search on Bibsonomy ISIT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap A lattice coding scheme for secret key generation from Gaussian Markov tree sources. Search on Bibsonomy ISIT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou When is omniscience a rate-optimal strategy for achieving secret key capacity? Search on Bibsonomy ITW The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap, Andrew Thangaraj Secure Compute-and-Forward in a Bidirectional Relay. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap The communication complexity of achieving SK capacity in a class of PIN models. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Chun Lam Chan, Winston Fernandes, Navin Kashyap, Manjunath Krishnapur Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Pranab Basu, Navin Kashyap On linear subspace codes closed under intersection. Search on Bibsonomy NCC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap The communication complexity of achieving SK capacity in a class of PIN models. Search on Bibsonomy ISIT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Chun 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. Search on Bibsonomy ISIT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint. Search on Bibsonomy Allerton The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Oron Sabag, Haim H. Permuter, Navin Kashyap Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback. Search on Bibsonomy ITW The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap Some "goodness" properties of LDA lattices. Search on Bibsonomy ITW The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap Nested lattice codes for secure bidirectional relaying with asymmetric channel gains. Search on Bibsonomy ITW The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Gilles Zémor Upper Bounds on the Size of Grain-Correcting Codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam Achieving SK Capacity in the Source Model: When Must All Terminals Talk? Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Shashank Vatedka, Navin Kashyap Some "Goodness" Properties of LDA Lattices. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam Achieving SK capacity in the source model: When must all terminals talk? Search on Bibsonomy ISIT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Manuj Mukherjee, Navin Kashyap On the communication complexity of secret key generation in the multiterminal source model. Search on Bibsonomy ISIT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Gilles Zémor Upper Bounds on the Size of Grain-Correcting Codes Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Akiko Manada, Navin Kashyap On the Zeta Function of a Periodic-Finite-Type Shift. Search on Bibsonomy IEICE Transactions The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1V. Shashank, Navin Kashyap Lattice coding for strongly secure compute-and-forward in a bidirectional relay. Search on Bibsonomy ISIT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Gilles Zémor Upper bounds on the size of grain-correcting codes. Search on Bibsonomy ISIT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1K. Manickam Shivkumar, Navin Kashyap On 2-D non-adjacent-error channel models. Search on Bibsonomy ITW The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Winston Fernandes, Navin Kashyap A phase transition for the uniform distribution in the pattern maximum likelihood problem. Search on Bibsonomy ITW The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Andrew Thangaraj The Treewidth of MDS and Reed-Muller Codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, V. Shashank, Andrew Thangaraj Secure Compute-and-Forward in a Bidirectional Relay Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Himanshu Tyagi, Navin Kashyap, Yogesh Sankarasubramaniam, Kapali Viswanathan Fault-tolerant secret key generation. Search on Bibsonomy ISIT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, V. Shashank, Andrew Thangaraj Secure computation in a bidirectional relay. Search on Bibsonomy ISIT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ya Meng, Navin Kashyap The effect of malformed tiles on tile assemblies within the kinetic tile assembly model. Search on Bibsonomy Natural Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arya Mazumdar, Alexander Barg, Navin Kashyap Coding for High-Density Recording on a 1-D Granular Magnetic Medium. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Andrew Thangaraj On the Treewidth of MDS and Reed-Muller Codes Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Navin Kashyap, Andrew Thangaraj On the treewidth of MDS and Reed-Muller codes. Search on Bibsonomy ISIT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arya Mazumdar, Alexander Barg, Navin Kashyap Coding for High-Density Recording on a 1-D Granular Magnetic Medium Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Arya Mazumdar, Alexander Barg, Navin Kashyap Coding for high-density magnetic recording. Search on Bibsonomy ISIT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Farzad Farnoud, Chien-Yu Chen 0005, Olgica Milenkovic, Navin Kashyap A graphical model for computing the minimum cost transposition distance. Search on Bibsonomy ITW The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, David L. Neuhoff Data Synchronization With Timing: The Variable-Rate Case. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Navin Kashyap Constraint complexity of realizations of linear codes on arbitrary graphs. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Navin Kashyap On minimal tree realizations of linear codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Akiko Manada, Navin Kashyap A Comparative Study of Periods in a Periodic-Finite-Type Shift. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Akiko Manada, Navin Kashyap The Zeta Function of a Periodic-Finite-Type Shift Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Ya Meng, Navin Kashyap The Effect of Malformed Tiles on Tile Assemblies within kTAM. Search on Bibsonomy DNA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Akiko Manada The zeta function of a periodic-finite-type shift. Search on Bibsonomy ISIT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Navin Kashyap A Decomposition Theory for Binary Linear Codes. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Navin Kashyap Matroid Pathwidth and Code Trellis Complexity. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Navin Kashyap Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Akiko Manada, Navin Kashyap On the Period of a Periodic-Finite-Type Shift Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Adam Cohen, Fady Alajaji, Navin Kashyap, Glen Takahara LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel. Search on Bibsonomy IEEE Communications Letters The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Akiko Manada, Navin Kashyap On the period of a periodic-finite-type shift. Search on Bibsonomy ISIT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Navin Kashyap Matroid Pathwidth and Code Trellis Complexity Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Navin Kashyap On Minimal Tree Realizations of Linear Codes Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Navin Kashyap The "Art of Trellis Decoding" Is NP-Hard. Search on Bibsonomy AAECC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Navin Kashyap Code Decomposition: Theory and Applications. Search on Bibsonomy ISIT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Olgica Milenkovic, Navin Kashyap, David Leyba Shortened Array Codes of Large Girth. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel, Alexander Vardy Coding for the optical channel: the ghost-pulse constraint. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, David L. Neuhoff Periodic prefix-synchronized codes: A generating function approach. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Akiko Manada, Navin Kashyap On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Navin Kashyap A Decomposition Theory for Binary Linear Codes Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Akiko Manada, Navin Kashyap On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type. Search on Bibsonomy ISIT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel, Alexander Vardy An Application of Ramsey Theory to Coding for the Optical Channel. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel, Alexander Vardy Coding for the Optical Channel: the Ghost-Pulse Constraint Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Olgica Milenkovic, Navin Kashyap, David Leyba Shortened Array Codes of Large Girth Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Olgica Milenkovic, Navin Kashyap DNA Codes that Avoid Secondary Structures Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Olgica Milenkovic, Navin Kashyap On the Design of Codes for DNA Computing. Search on Bibsonomy WCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Olgica Milenkovic, Navin Kashyap DNA codes that avoid secondary structures. Search on Bibsonomy ISIT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity. Search on Bibsonomy IEEE Trans. Information Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel Ghostbusting: Coding for Optical Communications. Search on Bibsonomy Advances in Information Recording The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity. Search on Bibsonomy ISIT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel, Alexander Vardy A Ramsey theory approach to ghostbusting. Search on Bibsonomy ISIT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Navin Kashyap, Paul H. Siegel Equalities among Capacities of (d, k)-Constrained Systems. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2003 DBLP  BibTeX  RDF
1Navin Kashyap Maximizing the Shannon Capacity of Constrained Systems with Two Constraints. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2003 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 103 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license