Cover Image

Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abiad, Aida, Reijnders, Harper, Tait, Michael
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Eigenvalue bounds for distance-edge colorings
by: Abiad, Aida, et al.
Published: (2025)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)

A linear programming bound for sum-rank metric codes
by: Abiad, Aida, et al.
Published: (2024)

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
by: Abiad, Aida, et al.
Published: (2024)

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

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
by: Abiad, Aida, et al.
Published: (2026)

A graph energy conjecture through the lenses of semidefinite programming
by: Abiad, Aida, et al.
Published: (2025)

The edge-isoperimetric number of graphs and their powers: approaches from spectral graph theory, optimization and finite geometry
by: Abiad, Aida, et al.
Published: (2026)

Unified bounds for the independence number of graph powers
by: Abiad, Aida, et al.
Published: (2024)

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

Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
by: Nguyen, The
Published: (2024)

On the sum of the largest and smallest eigenvalues of odd-cycle free graphs
by: Abiad, Aida, et al.
Published: (2025)

Switching graphs and Hadamard matrices
by: Abiad, Aida, et al.
Published: (2024)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
by: Abiad, Aida, et al.
Published: (2026)

Propagation processes on (hyper)graphs: where zero forcing and burning meet
by: Abiad, Aida, et al.
Published: (2026)

An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
by: Abiad, Aida, et al.
Published: (2026)

A unified framework for the Expander Mixing Lemma for irregular graphs and its applications
by: Abiad, Aida, et al.
Published: (2024)

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics
by: Keshav, Goyal, et al.
Published: (2023)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)

Counting cospectral graphs obtained via switching
by: Abiad, Aida, et al.
Published: (2025)

One-weight codes in the sum-rank metric
by: Mushrraf, Usman, et al.
Published: (2025)

Hoffman colorings of graphs
by: Abiad, Aida, et al.
Published: (2024)

The Shannon capacity of graph powers
by: Abiad, Aida, et al.
Published: (2025)

On the existence of small strictly Neumaier graphs
by: Abiad, Aida, et al.
Published: (2023)

On the non-existence of perfect codes in the sum-rank metric
by: Del Prete, Giuseppe, et al.
Published: (2025)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
by: Abiad, Aida, et al.
Published: (2023)

Note on the product of the largest and the smallest eigenvalue of a graph
by: Abiad, Aida, et al.
Published: (2024)

Hoffman colorability of (strongly) regular graphs
by: Abiad, Aida, et al.
Published: (2025)

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 $Z_q$-forcing number: computational approach and exact values
by: Abiad, Aida, et al.
Published: (2025)

Invariants for sum-rank metric codes
by: Santonastaso, Paolo, et al.
Published: (2025)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
by: Abiad, Aida, et al.
Published: (2026)

Tales of Hoffman: from a distance
by: Abiad, Aida, et al.
Published: (2025)

Constructing cospectral hypergraphs
by: Abiad, Aida, et al.
Published: (2022)

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

Switching methods of level 2 for the construction of cospectral graphs
by: Abiad, Aida, et al.
Published: (2024)

Representability of $q$-matroids via rank-metric codes
by: Alfarano, Gianira N., et al.
Published: (2026)

Improved bounds on the postage stamp problem for large numbers of stamps
by: Faust, Eric James, et al.
Published: (2025)

The geometry of covering codes in the sum-rank metric
by: Bonini, Matteo, et al.
Published: (2024)

New constructions and bounds for nonabelian Sidon sets with applications to Turán-type problems
by: Byrne, John, et al.
Published: (2025)