By Topic

Chains, Demi-Matroids, and Profiles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Britz, T. ; Sch. of Math. & Stat., Univ. of New South Wales, Sydney, NSW, Australia ; Johnsen, T. ; Martin, J.

It is shown that each chain of linear codes has an associated demi-matroid, a combinatorial structure that extends the notion of a vector matroid of a linear code. These demi-matroids are proven to determine important properties of the chain, and it is shown that linear code chain duality is represented by demi-matroid duality in a natural and yet surprising way. Profiles are defined for arbitrary demi-matroids and thus for linear code chains, which generalizes previous results in the literature and provides simple and transparent proofs thereof. Finally, applications are given to encryption of messages through wire-tap channels of Type II.

Published in:

Information Theory, IEEE Transactions on  (Volume:60 ,  Issue: 2 )