On the data persistency of replicated erasure codes in distributed storage systems

DOI10.1016/J.IC.2025.105297MaRDI QIDQ6982304zbMATH OpenFDO

Authors Roy Friedman, Rafał Kapelko, Karol Marchwicki

Publication date 19 May 2025

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IC.2025.105297

zbMATH Keywords

asymptotic boundserasure codesreplicationstorage system

Mathematics Subject Classification ID

Distributed systems (68M14) Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites work

• An explicit formula for the coefficients in Laplace's method
• Average case analysis of algorithms on sequences. With a foreword by Philippe Flajolet
• Cascade Codes for Distributed Storage Systems
• Guessing Attacks on Distributed-Storage Systems
• scientific article; zbMATH DE number 3117699 (Why is no real title available?)
• scientific article; zbMATH DE number 1931818 (Why is no real title available?)
• Locality and Availability in Distributed Storage
• NIST digital library of mathematical functions
• On the coefficients that arise from Laplace's method
• Statistical distributions.

This page was built for publication: On the data persistency of replicated erasure codes in distributed storage systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982304)