Sciweavers

7 search results - page 2 / 2
» The Excluded Minors for GF(4)-Representable Matroids
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 5 months ago
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 ...
Navin Kashyap
DM
2002
102views more  DM 2002»
13 years 5 months ago
Infinite antichains of matroids with characteristic set {p}
For each prime p, we construct an infinite antichain of matroids in which each matroid has characteristic set {p}. For p = 2, each of the matroids in our antichain is an excluded m...
James G. Oxley, Charles Semple, Dirk L. Vertigan, ...