Imagen de Portada

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abiad, Aida, Neri, Alessandro, Reijnders, Luuk
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory
por: Abiad, Aida, et al.
Publicado: (2025)

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

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

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

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

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

Generalized graph codes and thier minimum distances
por: Fujii, Naoki
Publicado: (2025)

The geometry of rank-metric codes
por: Alfarano, Gianira N., et al.
Publicado: (2026)

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

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

Trellis codes with a good distance profile constructed from expander graphs
por: Zhu, Yubin, et al.
Publicado: (2026)

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

On low-power error-correcting cooling codes with large distances
por: Zhao, Yuhao, et al.
Publicado: (2024)

On the size of maximal binary codes with 2, 3, and 4 distances
por: Barg, Alexander, et al.
Publicado: (2022)

Outer Strong Blocking Sets
por: Alfarano, Gianira N., et al.
Publicado: (2023)

On the independence number of de Bruijn graphs
por: Majer, Pietro, et al.
Publicado: (2026)

On the number of inequivalent linearized Reed-Solomon codes
por: Mannaert, Jonathan, et al.
Publicado: (2026)

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

Improved upper bounds for wide-sense frameproof codes
por: Zhao, Yuhao, et al.
Publicado: (2024)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
por: Xiong, Yanzhen, et al.
Publicado: (2026)

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

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
por: Kiermaier, Michael, et al.
Publicado: (2015)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
por: Shen, Yuanting, et al.
Publicado: (2024)

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

Switching graphs and Hadamard matrices
por: Abiad, Aida, et al.
Publicado: (2024)

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

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
por: Sason, Igal
Publicado: (2025)

Semidefinite lower bounds for covering codes
por: Gijswijt, Dion, et al.
Publicado: (2025)

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

On the $Z_q$-forcing number: computational approach and exact values
por: Abiad, Aida, et al.
Publicado: (2025)

A new family of $2$-scattered subspaces and related MRD codes
por: Bartoli, Daniele, et al.
Publicado: (2024)

The geometry of intersecting codes and applications to additive combinatorics and factorization theory
por: Borello, Martino, et al.
Publicado: (2024)

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

An infinite family of non-extendable MRD codes
por: Bartoli, Daniele, et al.
Publicado: (2026)

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