Generalizations of Wei's Duality Theorem
Information Theory
2009-10-13 v1 math.IT
Abstract
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two Wei-type duality theorems for new combinatorial structures that are introduced and named {\em demi-matroids}. These generalize matroids and are the appropriate combinatorial objects for describing the duality in Wei's Duality Theorem. A new proof of the Duality Theorem is thereby given that explains the theorem in combinatorial terms. Special cases of the general duality theorems are also given, including duality theorems for cycles and bonds in graphs and for transversals.
Cite
@article{arxiv.0910.2099,
title = {Generalizations of Wei's Duality Theorem},
author = {Thomas Britz and Bård Heiseldel and Trygve Johnsen and Dillon Mayhew and Keisuke Shiromoto},
journal= {arXiv preprint arXiv:0910.2099},
year = {2009}
}
Comments
10 pages, 1 figure