Image de couverture de livre

Advances in the Shannon Capacity of Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lavi, Nitay, Sason, Igal
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

On H-Intersecting Graph Families and Counting of Homomorphisms
par: Sason, Igal
Publié: (2025)

Counting Graph Homomorphisms in Bipartite Settings
par: Sason, Igal
Publié: (2025)

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

The Lovász Local Lemma: Fundamentals, Applications, and Perspectives
par: Sason, Igal
Publié: (2026)

On Strongly Regular Graphs and the Friendship Theorem
par: Sason, Igal
Publié: (2025)

On the Ratio of Shannon Numbers of Graphs
par: Alipour, Sharareh, et autres
Publié: (2023)

On Spectral Graph Determination
par: Sason, Igal, et autres
Publié: (2024)

Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
par: Abbe, Emmanuel, et autres
Publié: (2024)

On the transitivity of Gilbert graphs and their complements
par: Krupnik, Noam, et autres
Publié: (2026)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
par: Guo, Zeyu, et autres
Publié: (2024)

LDPC Codes Achieve List Decoding Capacity
par: Mosheiff, Jonathan, et autres
Publié: (2019)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
par: Brakensiek, Joshua, et autres
Publié: (2022)

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
par: Iyer, Rishabh
Publié: (2026)

Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs
par: Hildebrant, Todd
Publié: (2026)

Entropy of Exchangeable Random Graphs
par: Skeja, Anda, et autres
Publié: (2023)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
par: Skeja, Anda, et autres
Publié: (2024)

SASH: Decoding Community Structure in Graphs
par: Beemer, Allison, et autres
Publié: (2025)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
par: Bresler, Guy, et autres
Publié: (2025)

Optimal Erasure Codes and Codes on Graphs
par: Chen, Yeyuan, et autres
Publié: (2025)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Private Information Retrieval over Graphs
par: Ge, Gennian, et autres
Publié: (2025)

Shannon meets Gödel-Tarski-Löb: Undecidability of Shannon Feedback Capacity for Finite-State Channels
par: Majumdar, Angshul
Publié: (2026)

Cluster Synchronization via Graph Laplacian Eigenvectors
par: Timofeyev, Tobias, et autres
Publié: (2025)

The generalized trifference problem
par: Bishnoi, Anurag, et autres
Publié: (2025)

Linear rank-metric intersecting codes
par: Bartoli, Daniele, et autres
Publié: (2025)

The asymptotic number of equivalence classes of linear codes with given dimension
par: Di Giusto, Andrea, et autres
Publié: (2025)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
par: Berend, Hagai, et autres
Publié: (2025)

On the cross-correlation properties of large-size families of Costas arrays
par: Liu, Runfeng, et autres
Publié: (2025)

Hyper-Minrank: A Unified Hypergraph Characterization of Multi-Sender Index Coding
par: Khalesi, Ali, et autres
Publié: (2025)

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
par: Xi, Yuanxiao, et autres
Publié: (2025)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
par: Yu, Wenjun, et autres
Publié: (2025)

Additive codes from linear codes
par: Ball, Simeon, et autres
Publié: (2025)

Sequence Reconstruction over the Deletion Channel
par: Zhu, Fengxing
Publié: (2025)

Bounds on Box Codes
par: Langberg, Michael, et autres
Publié: (2025)

Clubs in projective spaces and three-weight rank-metric codes
par: Mannaert, Jonathan, et autres
Publié: (2025)

Delsarte duality on subspaces and applications to rank-metric codes and q-matroids
par: Borello, Martino, et autres
Publié: (2025)

Bounds on $k$-hash distances and rates of linear codes
par: Della Fiore, Stefano, et autres
Publié: (2025)

Representation of Symmetric Shift Registers
par: Søreng, Jan
Publié: (2025)