Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Caillat-Grenier, Geoffroy, Romashchenko, Andrei
Format:	Preprint
Published:	2023
Subjects:	Information Theory Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Random Schreier graphs as expanders
by: Caillat-Grenier, Geoffroy
Published: (2023)

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

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

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

Permutation Entropy for Signal Analysis
by: Kay, Bill, et al.
Published: (2023)

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

New Solutions to Delsarte's Dual Linear Programs
by: Chailloux, André, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)

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

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

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

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

The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)

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

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

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

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

Dimensionality and randomness
by: Barmpalias, George, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)

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

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