117 citations · 410 across the 60 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.IT2007★ 11 cited
On Minimal Tree Realizations of Linear Codes
Navin Kashyap
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,…
cs.DM2007
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…