Cover Image

Secure Storage using Maximally Recoverable Locally Repairable Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Janz, Tim, Liu, Hedongliang, Bitar, Rawad, Kschischang, Frank R.
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

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

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

Byzantine-Resilient Gradient Coding through Local Gradient Computations
by: Hofmeister, Christoph, et al.
Published: (2024)

Channel Coding based on Skew Polynomials and Multivariate Polynomials
by: Liu, Hedongliang
Published: (2025)

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

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

On Binary Shadow Codes
by: Tasbihi, Amir, et al.
Published: (2024)

Higher-Order Staircase Codes: A Unified Generalization of High-Throughput Coding Techniques
by: Shehadeh, Mohannad, et al.
Published: (2024)

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

Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
by: Egger, Maximilian, et al.
Published: (2024)

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

Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
by: Sukmadji, Alvin Y., et al.
Published: (2024)

Performance-Complexity-Latency Trade-offs of Concatenated RS-SDBCH Codes
by: Sukmadji, Alvin Y., et al.
Published: (2024)

Performance-Complexity-Latency Trade-offs of Concatenated RS-SDBCH Codes
by: Sukmadji, Alvin Y., et al.
Published: (2024)

Maximal-Capacity Discrete Memoryless Channel Identification
by: Egger, Maximilian, et al.
Published: (2024)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

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

Generalized Spatially-Coupled Product-Like Codes Using Zipper Codes With Irregular Degree
by: Sukmadji, Alvin Y., et al.
Published: (2023)

Zipper Codes
by: Sukmadji, Alvin Y., et al.
Published: (2022)

Generalized Staircase Codes with Arbitrary Bit Degree
by: Shehadeh, Mohannad, et al.
Published: (2023)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
by: Liu, Hedongliang, et al.
Published: (2022)

Polarization-Dependent Loss Mitigation via Orthogonal Design Precoding and Interference Cancellation
by: Shehadeh, Mohannad, et al.
Published: (2025)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)

Higher-Order Staircase Codes
by: Shehadeh, Mohannad, et al.
Published: (2023)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
by: Bastos, Gustavo Terra, et al.
Published: (2024)

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

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

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

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

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)

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

Constituent automorphism decoding of Reed-Muller codes
by: Qu, Yicheng, et al.
Published: (2024)

New Difference Triangle Sets by an FPGA-Based Search Technique
by: Shehadeh, Mohannad, et al.
Published: (2025)

$q$-ary Sequential Locally Recoverable Codes from the Product Construction
by: Baghban, Akram, et al.
Published: (2024)

A Gröbner Approach to Dual-Containing Cyclic Left Module $(θ,δ)$-Codes over Finite Commutative Frobenius Rings
by: Liu, Hedongliang, et al.
Published: (2023)

Federated One-Shot Learning with Data Privacy and Objective-Hiding
by: Egger, Maximilian, et al.
Published: (2025)

Soft Demapping of Spherical Codes from Cartesian Powers of PAM Constellations
by: Borujeny, Reza Rafie, et al.
Published: (2024)

Multi-Terminal Remote Generation and Estimation Over a Broadcast Channel With Correlated Priors
by: Egger, Maximilian, et al.
Published: (2025)

Beyond Trade-offs: A Unified Framework for Privacy, Robustness, and Communication Efficiency in Federated Learning
by: Xia, Yue, et al.
Published: (2025)