Cover Image

The Cloud and Flock Polynomials of q-Matroids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gluesing-Luerssen, Heide, Jany, Benjamin
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial Invariants of q-Matroids and Rank-Metric Codes
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

Quasi-optimal cyclic orbit codes
by: Castello, Chiara, et al.
Published: (2025)

Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)

$t$-Balanced Codes with the Kendall-$τ$ Metric
by: Jany, Benjamin, et al.
Published: (2024)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
by: Chen, Qi, et al.
Published: (2023)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)

Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)

Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs
by: Hildebrant, Todd
Published: (2026)

Delsarte duality on subspaces and applications to rank-metric codes and q-matroids
by: Borello, Martino, et al.
Published: (2025)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)

On one-orbit cyclic subspace codes of $\mathcal{G}_q(n,3)$
by: Castello, Chiara, et al.
Published: (2024)

Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
by: Abbe, Emmanuel, et al.
Published: (2024)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
by: Brakensiek, Joshua, et al.
Published: (2023)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Optimizing Extension Techniques for Discovering Non-Algebraic Matroids
by: Bamiloshin, Michael, et al.
Published: (2024)

Volume Polynomials and Log-concavity of the Characteristic Polynomials of Matroids
by: Katz, Eric
Published: (2025)

The free product of $q$-matroids
by: Alfarano, Gianira N., et al.
Published: (2024)

Convertible Codes for Data and Device Heterogeneity
by: Gruica, Anina, et al.
Published: (2026)

Upper bounds on the rate of linear $q$-ary $k$-hash codes
by: Della Fiore, Stefano, et al.
Published: (2024)

Eigenvalue bounds for the quantum chromatic number of graph powers
by: Abiad, Aida, et al.
Published: (2025)

The generalized trifference problem
by: Bishnoi, Anurag, et al.
Published: (2025)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

The asymptotic number of equivalence classes of linear codes with given dimension
by: Di Giusto, Andrea, et al.
Published: (2025)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
by: Berend, Hagai, et al.
Published: (2025)

On the cross-correlation properties of large-size families of Costas arrays
by: Liu, Runfeng, et al.
Published: (2025)

Hyper-Minrank: A Unified Hypergraph Characterization of Multi-Sender Index Coding
by: Khalesi, Ali, et al.
Published: (2025)

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
by: Xi, Yuanxiao, et al.
Published: (2025)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
by: Yu, Wenjun, et al.
Published: (2025)

Additive codes from linear codes
by: Ball, Simeon, et al.
Published: (2025)

Sequence Reconstruction over the Deletion Channel
by: Zhu, Fengxing
Published: (2025)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

Clubs in projective spaces and three-weight rank-metric codes
by: Mannaert, Jonathan, et al.
Published: (2025)

On H-Intersecting Graph Families and Counting of Homomorphisms
by: Sason, Igal
Published: (2025)

Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)

Representation of Symmetric Shift Registers
by: Søreng, Jan
Published: (2025)

Latroids and code invariants
by: Gorla, Elisa, et al.
Published: (2025)

On the minimum Hamming distance between vectorial Boolean and affine functions
by: Nagy, Gabor P.
Published: (2025)

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)