Weighted subspace designs from \(q\)-polymatroids

DOI10.1016/j.jcta.2023.105799zbMath1527.05033arXiv2104.12463OpenAlexW3157583276MaRDI QIDQ6071951

Sorina Ionica, Relinde P. M. J. Jurrius, Michela Ceria, Eimear Byrne

Publication date: 29 November 2023

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

characteristic polynomial\(q\)-analogue\(q\)-polymatroidweighted subspace design

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matroids and geometric lattices (05B35) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

The direct sum of \(q\)-matroids ⋮ Critical problem for a \(q\)-analogue of polymatroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric approach to rank metric codes and a classification of constant weight codes
• A MacWilliams type identity for matroids
• Association schemes and t-designs in regular semilattices
• Characteristic polynomials of weighted lattices
• The Magma algebra system. I: The user language
• An Assmus-Mattson-type approach for identifying 3-designs from linear codes over \(\mathbb{Z}_4\)
• Defining the \(q\)-analogue of a matroid
• On the genericity of maximum rank distance and Gabidulin codes
• An Assmus-Mattson theorem for codes over commutative association schemes
• On the inequalities of \(t\)-designs over a finite field
• Codes with the rank metric and matroids
• Infinite families of 2-designs and 3-designs from linear codes
• Constructions of new \(q\)-cryptomorphisms
• \(q\)-polymatroids and their relation to rank-metric codes
• Rank-metric codes and \(q\)-polymatroids
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• Constructions of new matroids and designs over \(\mathbb{F}_q\)
• Discrete q-Distributions
• Designs from Matroids
• An Assmus--Mattson Theorem for Rank Metric Codes
• New 5-designs
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries
• Intersection Numbers For Subspace Designs

This page was built for publication: Weighted subspace designs from \(q\)-polymatroids