Treffer: Chains, Demi-Matroids, and Profiles

Title:
Chains, Demi-Matroids, and Profiles
Source:
IEEE transactions on information theory. 60(2):986-991
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2014.
Publication Year:
2014
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
School of Mathematics and Statistics, University of New South Wales, Sydney 2052, Australia
Department of Mathematics and Statistics, University of Tromsø, Tromsø, 9037, Norway
ISSN:
0018-9448
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.28203307
Database:
PASCAL Archive

Weitere Informationen

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.