Defining the \(q\)-analogue of a matroid (Q1658766): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Relinde P. M. J. Jurrius / rank
 
Normal rank
Property / author
 
Property / author: Pellikaan, Ruud / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.09250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometries for rank distance and permutation group of gabidulin codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXISTENCE OF -ANALOGS OF STEINER SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective Geometry over  1 and the Gaussian Binomial Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of codes with maximum rank distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2914102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight Enumeration and the Geometry of Linear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coset leader and list weight enumerator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defining generalized rank weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting solutions of polynomial systems via iterated fibrations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in algebraic combinatorics. Based on the international symposium on algebraic combinatorics, Fukuoka, Japan, 1993 and the research project on algebraic combinatorics, Kyoto, Japan, April 1994 -- March 1995 / rank
 
Normal rank

Latest revision as of 07:59, 16 July 2024

scientific article
Language Label Description Also known as
English
Defining the \(q\)-analogue of a matroid
scientific article

    Statements

    Defining the \(q\)-analogue of a matroid (English)
    0 references
    15 August 2018
    0 references
    Summary: This paper defines the \(q\)-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a \(q\)-matroid, and why they are (not) cryptomorphic. Also, we explain the motivation for studying \(q\)-matroids by showing that a rank metric code gives a \(q\)-matroid.
    0 references
    matroid theory
    0 references
    \(q\)-analogue
    0 references
    rank metric codes
    0 references
    0 references

    Identifiers