论文信息 - Wei-type duality theorems for matroids

Wei-type duality theorems for matroids

We present several fundamental duality theorems for matroids and more general combinatorial structures. As a special case, these results show that the maximal cardinalities of fixed-ranked sets of a matroid determine the corresponding maximal cardinalities of the dual matroid. Our main results are applied to perfect matroid designs, graphs, transversals, and linear codes over division rings, in each case yielding a duality theorem for the respective class of objects.

[1] M. Deza,et al. Matroid Applications: Perfect Matroid Designs , 1992 .

[2] Aiden A. Bruen,et al. Error-correcting Codes, Finite Geometries and Cryptography , 2010 .

[3] H. Niederreiter. Point sets and sequences with small discrepancy , 1987 .

[4] AnneKathrine Larsen. Matroider og lineære koder , 2005 .

[5] Marcelo Firer,et al. Duality for Poset Codes , 2010, IEEE Transactions on Information Theory.

[6] Alexei E. Ashikhmin. On Generalized Hamming Weights for Galois Ring Linear Codes , 1998, Des. Codes Cryptogr..

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

[8] Keisuke Shiromoto,et al. On Generalized Hamming Weights for Codes over Finite Chain Rings , 2001, AAECC.

[9] Harald Niederreiter,et al. A combinatorial problem for vector spaces over finite fields , 1991, Discret. Math..

[10] Harald Niederreiter,et al. Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes , 1992, Discret. Math..

[11] Alexander Barg,et al. Near MDS poset codes and distributions , 2010, 2010 IEEE International Symposium on Information Theory.

[12] Thomas Britz,et al. Higher support matroids , 2007, Discret. Math..

[13] Richard A. Brualdi,et al. Codes with a poset metric , 1995, Discret. Math..

[14] I. G. Núñez,et al. Generalized Hamming Weights for Linear Codes , 2001 .

[15] Harald Neiderreiter. A combinatorial problem for vector spaces over finite fields , 1991 .