Cover Image

Polynomial Invariants of q-Matroids and Rank-Metric Codes

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

The Cloud and Flock Polynomials of q-Matroids
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

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

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

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

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
by: Cotardo, Giuseppe, et al.
Published: (2024)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
by: Guo, Zeyu, et al.
Published: (2024)

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

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

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

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

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

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

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

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

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)

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

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)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)

Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)

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

Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)

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

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

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)

The Service Rate Region of Hamming Codes
by: Choudhary, Priyanka, et al.
Published: (2025)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)

The Geometry of Codes for Random Access in DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

Codes with restricted overlaps: expandability, constructions, and bounds
by: Stanovnik, Lidija
Published: (2024)

A Survey on Codes from Simplicial Complexes
by: Wu, Yansheng, et al.
Published: (2024)

Binary Caps and LCD Codes with Large Dimensions
by: Ishizuka, Keita, et al.
Published: (2026)

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

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

Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, et al.
Published: (2025)

Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)

The Support Designs of Several Families of Lifted Linear Codes
by: Ding, Cunsheng, et al.
Published: (2024)

On Duplication-Free Codes for Disjoint or Equal-Length Errors
by: Yu, Wenjun, et al.
Published: (2024)

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
by: Ly, Hoang, et al.
Published: (2025)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
by: Jeronimo, Fernando Granha, et al.
Published: (2025)