Computer Science – Discrete Mathematics
Scientific paper
2007-05-10
Computer Science
Discrete Mathematics
Submitted to SIAM Journal on Discrete Mathematics; 18 pages, 6 figures
Scientific paper
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 representable matroid is NP-hard. Consequently, the problem of computing the trellis-width of a linear code is also NP-hard. For a finite field $\F$, we also consider the class of $\F$-representable matroids of pathwidth at most $w$, and correspondingly, the family of linear codes over $\F$ with trellis-width at most $w$. These are easily seen to be minor-closed. Since these matroids (and codes) have branchwidth at most $w$, a result of Geelen and Whittle shows that such matroids (and the corresponding codes) are characterized by finitely many excluded minors. We provide the complete list of excluded minors for $w=1$, and give a partial list for $w=2$.
No associations
LandOfFree
Matroid Pathwidth and Code Trellis Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Matroid Pathwidth and Code Trellis Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matroid Pathwidth and Code Trellis Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-600259