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 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$.

[1]  Paul D. Seymour,et al.  Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[2]  Charles Semple,et al.  The structure of 3-connected matroids of path width three , 2007, Eur. J. Comb..

[3]  James G. Oxley,et al.  Matroid theory , 1992 .

[4]  Geoff Whittle,et al.  Branch-Width and Rota's Conjecture , 2002, J. Comb. Theory, Ser. B.

[5]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[6]  Frank R. Kschischang,et al.  On the intractability of permuting a block code to minimize trellis complexity , 1996, IEEE Trans. Inf. Theory.

[7]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[8]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[9]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[10]  Bert Gerards,et al.  On Rota's conjecture and excluded minors containing large projective geometries , 2006, J. Comb. Theory, Ser. B.

[11]  F. Harary,et al.  Planar Permutation Graphs , 1967 .

[12]  Navin Kashyap,et al.  A Decomposition Theory for Binary Linear Codes , 2006, IEEE Transactions on Information Theory.

[13]  B. Mohar,et al.  Graph minors XXIII. Nash-Williams' immersion conjecture , 2010, J. Comb. Theory B.

[14]  J. Geelen,et al.  TOWARDS A MATROID-MINOR STRUCTURE THEORY , 2007 .

[15]  V. Vazirani,et al.  The "art of trellis decoding" is computationally hard-for large fields , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[16]  F. Harary,et al.  Outerplanar Graphs and Weak Duals , 1974 .

[17]  Douglas J. Muder.  Minimal trellises for block codes , 1988, IEEE Trans. Inf. Theory.

[18]  G. David Forney,et al.  Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.