Matroid Pathwidth and Code Trellis Complexity

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 the problem of computing the pathwidth of a graph, we show that the problem of determining the pathwidth of a representab... View More