117 citations · 410 across the 60 of their papers we have counts for
8 papers · 1 filter
The Lattice Structure of Linear Subspace Codes
Pranab Basu, Navin Kashyap
The projective space , i.e. the set of all subspaces of the vector space , is a metric space endowed with the subspace distance metric. Braun, Etzi…
Phase Transitions for the Uniform Distribution in the PML Problem and its Bethe Approximation
Chun Lam Chan, Winston Fernandes, Navin Kashyap +1
The pattern maximum likelihood (PML) estimate, introduced by Orlitsky et al., is an estimate of the multiset of probabilities in an unknown probability distribution , t…
Upper Bounds on the Size of Grain-Correcting Codes
Navin Kashyap, Gilles Zémor
In this paper, we re-visit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in…
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
Navin Kashyap
A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linea…
Matroid Pathwidth and Code Trellis Complexity
Navin Kashyap
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from…
A Decomposition Theory for Binary Linear Codes
Navin Kashyap
The decomposition theory of matroids initiated by Paul Seymour in the 1980's has had an enormous impact on research in matroid theory. This theory, when applied to matrices over th…