Image de couverture de livre

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Iyer, Rishabh
Format:	Preprint
Publié:	2026
Sujets:	Information Theory Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

The DNA Coverage Depth Problem: Duality, Weight Distributions, and Applications
par: Bertuzzo, Matteo, et autres
Publié: (2026)

The Coverage Depth Problem in DNA Storage Over Small Alphabets
par: Bertuzzo, Matteo, et autres
Publié: (2025)

Explicit constructions of optimal blocking sets and minimal codes
par: Bishnoi, Anurag, et autres
Publié: (2024)

A Search for High-Threshold Qutrit Magic State Distillation Routines
par: Prakash, Shiroman, et autres
Publié: (2024)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
par: Brakensiek, Joshua, et autres
Publié: (2025)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
par: Chen, Yeyuan, et autres
Publié: (2024)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
par: Guo, Zeyu, et autres
Publié: (2026)

Explicit determination of a class of permutation rational functions in any characteristic
par: Li, Yi, et autres
Publié: (2026)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
par: Chen, Qi, et autres
Publié: (2023)

Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
par: Bao, Jingjun, et autres
Publié: (2026)

Construction of CCC and ZCCS Through Additive Characters Over Galois Field
par: Ghosh, Gobinda, et autres
Publié: (2024)

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
par: Schaller, Michael, et autres
Publié: (2025)

Universal Costas Matrices: Towards a General Framework for Costas Array Construction
par: Gulec, Fatih, et autres
Publié: (2026)

Advances in the Shannon Capacity of Graphs
par: Lavi, Nitay, et autres
Publié: (2025)

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

Constructing rotatable permutations of $\mathbb{F}_{2^m}^3$ with $3$-homogeneous functions
par: Chi, Yunwen, et autres
Publié: (2024)

On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code
par: Klimov, Petr
Publié: (2026)

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

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
par: Liu, Hengfeng, et autres
Publié: (2025)

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)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
par: Li, Xin, et autres
Publié: (2024)

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)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
par: Mizunuma, Yuto, et autres
Publié: (2026)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
par: Gabrić, Daniel, et autres
Publié: (2024)

New Correlation Bound and Construction of Quasi-Complementary Code Sets
par: Sarkar, Palash, et autres
Publié: (2022)

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)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
par: Goldenberg, Elazar, et autres
Publié: (2024)

A Purely Entropic Approach to the Rainbow Triangle Problem
par: Chao, Ting-Wei, et autres
Publié: (2024)

Entropic additive energy and entropy inequalities for sums and products
par: Li, Rupert, et autres
Publié: (2025)

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Construction of extremal Type II $\mathbb{Z}_{8}$-codes via doubling method
par: Ban, Sara, et autres
Publié: (2024)

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

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

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
par: Bar-Lev, Daniella
Publié: (2026)

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
par: Jakhar, Gunank, et autres
Publié: (2026)

Triprojective almost perfect nonlinear permutations and functions
par: Göloğlu, Faruk, et autres
Publié: (2026)