Cover Image

Intersecting Codes and the Connectivity of $q$-Matroids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Conca, Fabrizio, Jany, Benjamin, Ravagnani, Alberto
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
by: Bertuzzo, Matteo, et al.
Published: (2026)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
by: Bertuzzo, Matteo, et al.
Published: (2025)

Eigenvalue bounds and alternating rank-metric codes
by: Abiad, Aida, et al.
Published: (2024)

A Combinatorial Perspective on Random Access Efficiency for DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

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

The Star Product of Uniformly Random Codes
by: Dinesen, Johan V., et al.
Published: (2025)

The Service Rate Region Polytope
by: Alfarano, Gianira N., 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)

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

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

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)

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

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)

Weighted-Hamming Metric: Bounds and Codes
by: Bitzer, Sebastian, et al.
Published: (2026)

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

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

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

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

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

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)

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

On the Parameters of Codes for Data Access
by: Kilic, Altan B., et al.
Published: (2024)

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

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)

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)

The Length of Functional Batch and PIR Codes
by: Kilic, Altan B., et al.
Published: (2025)