Copertina

Straggler-Aware Coded Polynomial Aggregation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhong, Xi, Kliewer, Jörg, Ji, Mingyue
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fundamental Limits of Coded Polynomial Aggregation
di: Zhong, Xi, et al.
Pubblicazione: (2026)

Uncoded Storage Coded Transmission Elastic Computing with Straggler Tolerance in Heterogeneous Systems
di: Zhong, Xi, et al.
Pubblicazione: (2024)

Uncoded Download in Lagrange-Coded Elastic Computing with Straggler Tolerance
di: Zhong, Xi, et al.
Pubblicazione: (2025)

Dual-Lagrange Encoding for Storage and Download in Elastic Computing for Resilience
di: Zhong, Xi, et al.
Pubblicazione: (2025)

Straggler-Resilient Differentially-Private Decentralized Learning
di: Yakimenka, Yauhen, et al.
Pubblicazione: (2022)

Context-Aware Search and Retrieval Over Erasure Channels
di: Ghasvarianjahromi, Sara, et al.
Pubblicazione: (2025)

Context-Aware Search and Retrieval Under Token Erasure
di: Ghasvarianjahromi, Sara, et al.
Pubblicazione: (2026)

Performance Bounds on Pliable Index Coding Using Absent Receivers
di: Ong, Lawrence, et al.
Pubblicazione: (2025)

Differentially-Private Decentralized Learning in Heterogeneous Multicast Networks
di: Ziaeddini, Amir, et al.
Pubblicazione: (2025)

Communication-Constrained Private Decentralized Online Personalized Mean Estimation
di: Yakimenka, Yauhen, et al.
Pubblicazione: (2025)

Reducing Subpacketization in Device-to-Device Coded Caching via Heterogeneous File Splitting
di: Zhang, Xiang, et al.
Pubblicazione: (2026)

Function Computation Without Secure Links: Information and Leakage Rates
di: Chou, Remi A., et al.
Pubblicazione: (2022)

Minimax Data Sanitization with Distortion Constraint and Adversarial Inference
di: Moatazedian, Amirarsalan, et al.
Pubblicazione: (2025)

Taming Subpacketization without Sacrificing Communication: A Packet Type-based Framework for D2D Coded Caching
di: Zhang, Xiang, et al.
Pubblicazione: (2026)

Optimal Rate Region for Multi-server Secure Aggregation with User Collusion
di: Li, Zhou, et al.
Pubblicazione: (2026)

Information-Theoretic Secure Aggregation over Regular Graphs
di: Zhang, Xiang, et al.
Pubblicazione: (2026)

Optimal Communication and Key Rate Region for Hierarchical Secure Aggregation with User Collusion
di: Zhang, Xiang, et al.
Pubblicazione: (2024)

Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage
di: Chou, Remi A., et al.
Pubblicazione: (2024)

Differentially-Private Collaborative Online Personalized Mean Estimation
di: Yakimenka, Yauhen, et al.
Pubblicazione: (2024)

Private Sum Computation: Trade-Offs between Communication, Randomness, and Privacy
di: Chou, Remi A., et al.
Pubblicazione: (2026)

Polynomials, Divided Differences, and Codes
di: Venkitesh, S.
Pubblicazione: (2024)

Channel Coding based on Skew Polynomials and Multivariate Polynomials
di: Liu, Hedongliang
Pubblicazione: (2025)

Quantum Locally Recoverable Codes via Good Polynomials
di: Sharma, Sandeep, et al.
Pubblicazione: (2024)

Structure-Preserving Error-Correcting Codes for Polynomial Frames
di: Chen, Baigang, et al.
Pubblicazione: (2025)

Generalized Weight Structure of Polar Codes: Selected Template Polynomials
di: Rowshan, Mohammad, et al.
Pubblicazione: (2026)

Polynomial Constructions and Deletion-Ball Geometry for Multiset Deletion Codes
di: Kreindel, Avraham, et al.
Pubblicazione: (2026)

Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication
di: Karpuk, David, et al.
Pubblicazione: (2023)

Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication
di: Gómez-Vilardebó, Jesús, et al.
Pubblicazione: (2024)

Advances in List Decoding of Polynomial Codes
di: Kumar, Mrinal, et al.
Pubblicazione: (2026)

Demystifying Why Local Aggregation Helps: Convergence Analysis of Hierarchical SGD
di: Wang, Jiayi, et al.
Pubblicazione: (2020)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
di: Gluesing-Luerssen, Heide, et al.
Pubblicazione: (2025)

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
di: Ron-Zewi, Noga, et al.
Pubblicazione: (2024)

High Rate Multivariate Polynomial Evaluation Codes
di: Kopparty, Swastik, et al.
Pubblicazione: (2024)

Capacity of Hierarchical Secure Coded Gradient Aggregation with Straggling Communication Links
di: Lu, Qinyi, et al.
Pubblicazione: (2024)

Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association
di: Zhang, Xiang, et al.
Pubblicazione: (2025)

Construction of Minimal Ternary Linear Codes with Dimension $m+2$ Via Krawtchouk Polynomials
di: Liu, Haibo, et al.
Pubblicazione: (2026)

Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity
di: Liu, Wenhao, et al.
Pubblicazione: (2024)

New Linear Codes from Matrix-Product Codes with Polynomial Units
di: Hernando, Fernando, et al.
Pubblicazione: (2009)

Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication
di: Weng, Shudi, et al.
Pubblicazione: (2025)

DALC: Distributed Arithmetic Coding Aided by Linear Codes
di: Zhou, Junwei, et al.
Pubblicazione: (2025)