117 citations · 410 across the 60 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.DM2008★ 7 cited
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…
cs.IT2008
On the Period of a Periodic-Finite-Type Shift
Akiko Manada, Navin Kashyap
Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of…