Defining the \(q\)-analogue of a matroid

zbMath1393.05071arXiv1610.09250MaRDI QIDQ1658766

Relinde P. M. J. Jurrius, Pellikaan, Ruud

Publication date: 15 August 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.09250

zbMATH Keywords

\(q\)-analoguematroid theoryrank metric codes

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Independent spaces of \(q\)-polymatroids ⋮ Weighted subspace designs from \(q\)-polymatroids ⋮ Some matroids related to sum-rank metric codes ⋮ Rank-metric codes and \(q\)-polymatroids ⋮ The Projectivization Matroid of a \(\boldsymbol{q}\) -Matroid ⋮ Coproducts in categories of \(q\)-matroids ⋮ Weight spectra of Gabidulin rank-metric codes and Betti numbers ⋮ Partitions of matrix spaces with an application to \(q\)-rook polynomials ⋮ Alternatives for the \(q\)-matroid axioms of independent spaces, bases, and spanning spaces ⋮ The direct sum of \(q\)-matroids ⋮ Critical problem for a \(q\)-analogue of polymatroids ⋮ Constructions of new matroids and designs over \(\mathbb{F}_q\) ⋮ A polymatroid approach to generalized weights of rank metric codes ⋮ Constructions of new \(q\)-cryptomorphisms ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ \(q\)-polymatroids and their relation to rank-metric codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Shellability and homology of \(q\)-complexes and \(q\)-matroids ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On defining generalized rank weights
• Counting solutions of polynomial systems via iterated fibrations
• Theory of codes with maximum rank distance
• 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
• EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
• On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
• The coset leader and list weight enumerator
• Isometries for rank distance and permutation group of gabidulin codes
• Weight Enumeration and the Geometry of Linear Codes
• Projective Geometry over  1 and the Gaussian Binomial Coefficients
• Quantum calculus