Navin Kashyap

According to our database1, Navin Kashyap authored at least 79 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
How many modes can a constrained Gaussian mixture have?
CoRR, 2020

Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Secure Information Exchange for Omniscience.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources.
IEEE Trans. Inf. Theory, 2019

Computable Upper Bounds on the Capacity of Finite-State Channels.
CoRR, 2019

The Lattice Structure of Linear Subspace Codes.
CoRR, 2019

The Effect of Introducing Redundancy in a Probabilistic Forwarding Protocol.
CoRR, 2019

Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values.
Proceedings of the National Conference on Communications, 2019

Probabilistic Forwarding of Coded Packets on Networks.
Proceedings of the IEEE International Symposium on Information Theory, 2019

The Capacity of Count-Constrained ICI-Free Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Computable Upper Bounds for Unifilar Finite-State Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

One-Shot Perfect Secret Key Agreement for Finite Linear Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint.
IEEE Trans. Inf. Theory, 2018

On the Optimality of Secret Key Agreement via Omniscience.
IEEE Trans. Inf. Theory, 2018

On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Phase Transitions for the Uniform Distribution in the Pattern Maximum Likelihood Problem and its Bethe Approximation.
SIAM J. Discret. Math., 2017

Some "goodness" properties of LDA lattices.
Probl. Inf. Transm., 2017

A maximization problem related to Huffman codes.
Proceedings of the Twenty-third National Conference on Communications, 2017

An optimal coding scheme for the BIBO channel with a no-repeated-ones input constraint.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Secret key agreement under discussion rate constraints.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint.
IEEE Trans. Inf. Theory, 2016

On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model.
IEEE Trans. Inf. Theory, 2016

MCMC Methods for Drawing Random Samples From the Discrete-Grains Model of a Magnetic Medium.
IEEE J. Sel. Areas Commun., 2016

A Capacity-Achieving Coding Scheme for the AWGN Channel with Polynomial Encoding and Decoding Complexity.
CoRR, 2016

When is omniscience a rate-optimal strategy for achieving secret key capacity?
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

A lattice coding scheme for secret key generation from Gaussian Markov tree sources.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Secure Compute-and-Forward in a Bidirectional Relay.
IEEE Trans. Inf. Theory, 2015

The Feedback Capacity of the (1, ∞)-RLL Input-Constrained Erasure Channel.
CoRR, 2015

Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation.
CoRR, 2015

On linear subspace codes closed under intersection.
Proceedings of the Twenty First National Conference on Communications, 2015

Nested lattice codes for secure bidirectional relaying with asymmetric channel gains.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

The communication complexity of achieving SK capacity in a class of PIN models.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Generalized belief propagation for estimating the partition function of the 2D Ising model.
Proceedings of the IEEE International Symposium on Information Theory, 2015

The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Upper Bounds on the Size of Grain-Correcting Codes.
IEEE Trans. Inf. Theory, 2014

Achieving SK capacity in the source model: When must all terminals talk?
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the communication complexity of secret key generation in the multiterminal source model.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
On the Zeta Function of a Periodic-Finite-Type Shift.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

On 2-D non-adjacent-error channel models.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

A phase transition for the uniform distribution in the pattern maximum likelihood problem.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Lattice coding for strongly secure compute-and-forward in a bidirectional relay.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
The Treewidth of MDS and Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2012

Secure Compute-and-Forward in a Bidirectional Relay
CoRR, 2012

Fault-tolerant secret key generation.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Secure computation in a bidirectional relay.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Coding for High-Density Recording on a 1-D Granular Magnetic Medium.
IEEE Trans. Inf. Theory, 2011

The effect of malformed tiles on tile assemblies within the kinetic tile assembly model.
Nat. Comput., 2011

2010
A graphical model for computing the minimum cost transposition distance.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Coding for high-density magnetic recording.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Data Synchronization With Timing: The Variable-Rate Case.
IEEE Trans. Inf. Theory, 2009

Constraint complexity of realizations of linear codes on arbitrary graphs.
IEEE Trans. Inf. Theory, 2009

On minimal tree realizations of linear codes.
IEEE Trans. Inf. Theory, 2009

A Comparative Study of Periods in a Periodic-Finite-Type Shift.
SIAM J. Discret. Math., 2009

The Effect of Malformed Tiles on Tile Assemblies within kTAM.
Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

2008
A Decomposition Theory for Binary Linear Codes.
IEEE Trans. Inf. Theory, 2008

Matroid Pathwidth and Code Trellis Complexity.
SIAM J. Discret. Math., 2008

LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel.
IEEE Commun. Lett., 2008

On the period of a periodic-finite-type shift.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Code Decomposition: Theory and Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2007

The "Art of Trellis Decoding" Is NP-Hard.
Proceedings of the Applied Algebra, 2007

2006
Shortened Array Codes of Large Girth.
IEEE Trans. Inf. Theory, 2006

Coding for the optical channel: the ghost-pulse constraint.
IEEE Trans. Inf. Theory, 2006

Periodic prefix-synchronized codes: A generating function approach.
IEEE Trans. Inf. Theory, 2006

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
An Application of Ramsey Theory to Coding for the Optical Channel.
SIAM J. Discret. Math., 2005

On the Design of Codes for DNA Computing.
Proceedings of the Coding and Cryptography, International Workshop, 2005

DNA codes that avoid secondary structures.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity.
IEEE Trans. Inf. Theory, 2004

A Ramsey theory approach to ghostbusting.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Ghostbusting: Coding for Optical Communications.
Proceedings of the Advances in Information Recording, 2004

2003
Equalities among Capacities of (d, k)-Constrained Systems.
SIAM J. Discret. Math., 2003

Maximizing the Shannon Capacity of Constrained Systems with Two Constraints.
SIAM J. Discret. Math., 2003

2001
On quantization with the Weaire-Phelan partition.
IEEE Trans. Inf. Theory, 2001

Data synchronization with timing.
IEEE Trans. Inf. Theory, 2001

1999
Codes for Data Synchronization with Timing.
Proceedings of the Data Compression Conference, 1999


  Loading...