:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Sason, Igal
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Information Theory
Online Access:	https://arxiv.org/abs/2505.07778
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Advances in the Shannon Capacity of Graphs
by: Lavi, Nitay, et al.
Published: (2025)

Observations on Graph Invariants with the Lovász $\vartheta$-Function
by: Sason, Igal
Published: (2023)

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

Counting Graph Homomorphisms in Bipartite Settings
by: Sason, Igal
Published: (2025)

The Lovász Local Lemma: Fundamentals, Applications, and Perspectives
by: Sason, Igal
Published: (2026)

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

On the transitivity of Gilbert graphs and their complements
by: Krupnik, Noam, et al.
Published: (2026)

On Strongly Regular Graphs and the Friendship Theorem
by: Sason, Igal
Published: (2025)

An improved lower bound on the Shannon capacities of complements of odd cycles
by: Zhu, Daniel G.
Published: (2024)

On the Ratio of Shannon Numbers of Graphs
by: Alipour, Sharareh, et al.
Published: (2023)

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

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

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

Stiefel manifolds and upper bounds for spherical codes and packings
by: Zargar, Masoud
Published: (2024)

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

On the stabilizer of the graph of linear functions over finite fields
by: Smaldore, Valentino, et al.
Published: (2024)

On Spectral Graph Determination
by: Sason, Igal, et al.
Published: (2024)

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

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

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

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

Edge inducibility via local directed graphs
by: Chao, Ting-Wei, et al.
Published: (2025)

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

On the $(k,\ell)$-multiset anonymity measure for social graphs
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)

On a recent extension of a family of biprojective APN functions
by: Kölsch, Lukas
Published: (2024)

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

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

Explicit determination of a class of permutation rational functions in any characteristic
by: Li, Yi, et al.
Published: (2026)

The capacity of a finite field matrix channel
by: Blackburn, Simon R., et al.
Published: (2022)

Triprojective almost perfect nonlinear permutations and functions
by: Göloğlu, Faruk, et al.
Published: (2026)

Equivalences of biprojective almost perfect nonlinear functions
by: Göloğlu, Faruk, et al.
Published: (2021)

Nonvanishing $k$-flats of Boolean and vectorial functions
by: Kaspers, Christian
Published: (2026)

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

Bent functions and strongly regular graphs
by: Smaldore, Valentino
Published: (2022)

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

Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)

Association schemes arising from non-weakly regular bent functions
by: Wei, Yadi, et al.
Published: (2024)

An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)

An exposition of recent list-size bounds of FRS Codes
by: Garg, Abhibhav, et al.
Published: (2025)

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
by: Kuffner, Luis, et al.
Published: (2024)