Imagen de Portada

New Solutions to Delsarte's Dual Linear Programs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chailloux, André, Debris-Alazard, Thomas
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
por: Liu, Hai, et al.
Publicado: (2026)

A Group Theoretic Construction of Batch Codes
por: Thomas, Eldho K.
Publicado: (2025)

Common information in well-mixing graphs and applications to information-theoretic cryptography
por: Caillat-Grenier, Geoffroy, et al.
Publicado: (2024)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
por: Yang, Yaoyu, et al.
Publicado: (2024)

Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
por: Li, Yun-Han, et al.
Publicado: (2024)

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings
por: Romashchenko, Andrei
Publicado: (2025)

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
por: Gürpınar, Emirhan, et al.
Publicado: (2020)

Combinatorial Group Testing in Presence of Deletions
por: Gandikota, Venkata, et al.
Publicado: (2023)

Information Content and Entropy of Finite Patterns from a Combinatorial Perspective
por: Pocze, Zsolt
Publicado: (2025)

Spectral approach to the communication complexity of multi-party key agreement
por: Caillat-Grenier, Geoffroy, et al.
Publicado: (2023)

A distance-free approach to generalized weights
por: Di Giusto, Andrea, et al.
Publicado: (2025)

Improved Hotplug Caching Schemes Using PDAs and t-Designs
por: Rajput, Charul, et al.
Publicado: (2023)

Permutation Entropy for Signal Analysis
por: Kay, Bill, et al.
Publicado: (2023)

On Function-Correcting Codes in the Lee Metric
por: Verma, Gyanendra K., et al.
Publicado: (2025)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
por: Wang, Shuche, et al.
Publicado: (2024)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)

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

Dimensionality and randomness
por: Barmpalias, George, et al.
Publicado: (2024)

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

Improved Upper Bound for the Size of a Trifferent Code
por: Bhandari, Siddharth, et al.
Publicado: (2024)

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

Optimal Erasure Codes and Codes on Graphs
por: Chen, Yeyuan, et al.
Publicado: (2025)

Generalized Three and Four Person Hat Game
por: van Uem, Theo
Publicado: (2017)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
por: Mizunuma, Yuto, et al.
Publicado: (2026)

The Labeled Coupon Collector Problem
por: Tan, Andrew, et al.
Publicado: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
por: Gabric, Daniel, et al.
Publicado: (2026)

Reconstructing graphs with subgraph compositions
por: Dailly, Antoine, et al.
Publicado: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
por: Yu, Lei
Publicado: (2025)

On the Codebook Design for NOMA Schemes from Bent Functions
por: Li, Chunlei, et al.
Publicado: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
por: Wu, Huawei
Publicado: (2026)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
por: Li, Xiaxin, et al.
Publicado: (2024)

Age of Information Diffusion on Social Networks
por: Li, Songhua, et al.
Publicado: (2023)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
por: Liang, Xue-Bin
Publicado: (2024)

Exact Thresholds for Noisy Non-Adaptive Group Testing
por: Chen, Junren, et al.
Publicado: (2024)

Group Testing: An Information Theory Perspective
por: Aldridge, Matthew, et al.
Publicado: (2019)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
por: Bhandari, Siddharth, et al.
Publicado: (2021)

On Worst-Case Optimal Polynomial Intersection
por: Sun, Yihang, et al.
Publicado: (2026)

Prime and Co-prime Integer Matrices
por: Xia, Xiang-Gen, et al.
Publicado: (2025)