Cover Image

Byzantine-Resilient Gradient Coding through Local Gradient Computations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hofmeister, Christoph, Maßny, Luis, Yaakobi, Eitan, Bitar, Rawad
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
by: Jain, Shreyas, et al.
Published: (2024)

Random Access Expectation in DNA Storage and Fountain Codes
by: Hofmeister, Christoph, et al.
Published: (2026)

Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs
by: Hofmeister, Christoph, et al.
Published: (2024)

Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning
by: Xia, Yue, et al.
Published: (2025)

Byzantine-Resilient Secure Aggregation for Federated Learning Without Privacy Compromises
by: Xia, Yue, et al.
Published: (2024)

CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
by: Hofmeister, Christoph, et al.
Published: (2025)

Private Aggregation for Byzantine-Resilient Heterogeneous Federated Learning
by: Egger, Maximilian, et al.
Published: (2025)

Between Close Enough to Reveal and Far Enough to Protect: a New Privacy Region for Correlated Data
by: Maßny, Luis, et al.
Published: (2025)

ProDiGy: Proximity- and Dissimilarity-Based Byzantine-Robust Federated Learning
by: Ergisi, Sena, et al.
Published: (2025)

Minimizing Latency for Secure Coded Computing Using Secret Sharing via Staircase Codes
by: Bitar, Rawad, et al.
Published: (2018)

On the Extension of Private Distributed Matrix Multiplication Schemes to the Grid Partition
by: Hofmeister, Christoph, et al.
Published: (2026)

LoByITFL: Low Communication Secure and Private Federated Learning
by: Xia, Yue, et al.
Published: (2024)

Error-Correcting Codes for the Sum Channel
by: Abboud, Lyan, et al.
Published: (2026)

Error-Correcting Codes for Labeled DNA Sequences
by: Hanania, Dganit, et al.
Published: (2025)

Secure Storage using Maximally Recoverable Locally Repairable Codes
by: Janz, Tim, et al.
Published: (2024)

Tail-Erasure-Correcting Codes
by: Moav, Boaz, et al.
Published: (2024)

Minimizing Latency for Secure Distributed Computing
by: Bitar, Rawad, et al.
Published: (2017)

Coding for Ordered Composite DNA Sequences
by: Dollma, Besart, et al.
Published: (2025)

Fundamental Limits of Decentralized Self-Regulating Random Walks
by: Khalesi, Ali, et al.
Published: (2026)

Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)

Scalable and Reliable Over-the-Air Federated Edge Learning
by: Egger, Maximilian, et al.
Published: (2024)

One Code Fits All: Strong stuck-at codes for versatile memory encoding
by: Con, Roni, et al.
Published: (2024)

Function-Correcting Codes for b-Symbol Read Channels
by: Singh, Anamika, et al.
Published: (2025)

Random Access in DNA Storage: Algorithms, Constructions, and Bounds
by: Wang, Chen, et al.
Published: (2026)

General Coverage Models: Structure, Monotonicity, and Shotgun Sequencing
by: Grunbaum, Yitzchak, et al.
Published: (2025)

Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
by: Singhvi, Shubhransh, et al.
Published: (2026)

DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
by: Boruchovsky, Avital, et al.
Published: (2023)

Coding Schemes for Document Exchange under Multiple Substring Edits
by: Narayanan, Hrishi, et al.
Published: (2026)

Serving Every Symbol: All-Symbol PIR and Batch Codes
by: Boruchovsky, Avital, et al.
Published: (2026)

Error-Correcting Codes for Nanopore Sequencing
by: Banerjee, Anisha, et al.
Published: (2023)

Bounds and Codes for General Phased Burst Errors
by: Bitzer, Sebastian, et al.
Published: (2025)

Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
by: Abraham, Hadas, et al.
Published: (2026)

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
by: Singhvi, Shubhransh, et al.
Published: (2024)

Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
by: Walter, Frederik, et al.
Published: (2024)

Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes
by: Beelen, Peter, et al.
Published: (2025)

Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
by: Cohen, Tomer, et al.
Published: (2025)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)

Private Repair of a Single Erasure in Reed-Solomon Codes
by: Kruglik, Stanislav, et al.
Published: (2024)

The Capacity of the Weighted Read Channel
by: Yerushalmi, Omer, et al.
Published: (2024)

Studying the Cycle Complexity of DNA Synthesis
by: Zrihan, Amit, et al.
Published: (2024)