Image de couverture de livre

Spectral approach to the communication complexity of multi-party key agreement

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Caillat-Grenier, Geoffroy, Romashchenko, Andrei
Format:	Preprint
Publié:	2023
Sujets:	Information Theory Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Common information in well-mixing graphs and applications to information-theoretic cryptography
par: Caillat-Grenier, Geoffroy, et autres
Publié: (2024)

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings
par: Romashchenko, Andrei
Publié: (2025)

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
par: Gürpınar, Emirhan, et autres
Publié: (2020)

Random Schreier graphs as expanders
par: Caillat-Grenier, Geoffroy
Publié: (2023)

A distance-free approach to generalized weights
par: Di Giusto, Andrea, et autres
Publié: (2025)

Combinatorial Group Testing in Presence of Deletions
par: Gandikota, Venkata, et autres
Publié: (2023)

Improved Hotplug Caching Schemes Using PDAs and t-Designs
par: Rajput, Charul, et autres
Publié: (2023)

Permutation Entropy for Signal Analysis
par: Kay, Bill, et autres
Publié: (2023)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
par: Yang, Yaoyu, et autres
Publié: (2024)

New Solutions to Delsarte's Dual Linear Programs
par: Chailloux, André, et autres
Publié: (2024)

Information Content and Entropy of Finite Patterns from a Combinatorial Perspective
par: Pocze, Zsolt
Publié: (2025)

Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
par: Li, Yun-Han, et autres
Publié: (2024)

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
par: Liu, Hai, et autres
Publié: (2026)

On Function-Correcting Codes in the Lee Metric
par: Verma, Gyanendra K., et autres
Publié: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

A Group Theoretic Construction of Batch Codes
par: Thomas, Eldho K.
Publié: (2025)

Universal cycle constructions for k-subsets and k-multisets
par: Campbell, Colin, et autres
Publié: (2026)

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

Generalized Three and Four Person Hat Game
par: van Uem, Theo
Publié: (2017)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
par: Wang, Shuche, et autres
Publié: (2024)

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

Threshold rates for properties of random codes
par: Guruswami, Venkatesan, et autres
Publié: (2020)

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

The Labeled Coupon Collector Problem
par: Tan, Andrew, et autres
Publié: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
par: Gabric, Daniel, et autres
Publié: (2026)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

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

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
par: Goyal, Keshav, et autres
Publié: (2024)

Dimensionality and randomness
par: Barmpalias, George, et autres
Publié: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
par: Goyal, Keshav, et autres
Publié: (2024)

Improved Upper Bound for the Size of a Trifferent Code
par: Bhandari, Siddharth, et autres
Publié: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
par: Li, Chunlei, et autres
Publié: (2025)

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

Age of Information Diffusion on Social Networks
par: Li, Songhua, et autres
Publié: (2023)

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

Group Testing: An Information Theory Perspective
par: Aldridge, Matthew, et autres
Publié: (2019)

Exact Thresholds for Noisy Non-Adaptive Group Testing
par: Chen, Junren, et autres
Publié: (2024)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
par: Aigner-Horev, Elad, et autres
Publié: (2023)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
par: Bhandari, Siddharth, et autres
Publié: (2021)

On Worst-Case Optimal Polynomial Intersection
par: Sun, Yihang, et autres
Publié: (2026)