Computer Science – Information Theory
Scientific paper
2009-10-12
Computer Science
Information Theory
10 pages, 1 figure
Scientific paper
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.
Britz Thomas
Heiseldel Bård
Johnsen Trygve
Mayhew Dillon
Shiromoto Keisuke
No associations
LandOfFree
Generalizations of Wei's Duality Theorem 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 Generalizations of Wei's Duality Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalizations of Wei's Duality Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-464153