On the public citation graph
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes
0 signed · 69 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/dsn.2018.00030openalex-snapshot
Alpha Entanglement Codes: Practical Erasure Codes to Archive Data in Unreliable Environments
inferredcites →https://doi.org/10.1109/glocomw.2010.5700274openalex-snapshot
Rebuilding for array codes in distributed storage systems
inferredcites →https://doi.org/10.1109/infcom.2011.5934901openalex-snapshot
Self-repairing homomorphic codes for distributed storage systems
inferredcites →https://doi.org/10.1109/isit.2013.6620354openalex-snapshot
Repair-optimal MDS array codes over GF(2)
inferredcites →https://doi.org/10.1109/msst.2019.00004openalex-snapshot
AZ-Code: An Efficient Availability Zone Level Erasure Code to Provide High Fault Tolerance in Cloud Storage Systems
inferredcites →https://doi.org/10.1109/sc.2006.19openalex-snapshot
CRUSH: Controlled, Scalable, Decentralized Placement of Replicated Data
inferredcites →https://doi.org/10.1109/tit.2010.2054295openalex-snapshot
Network Coding for Distributed Storage Systems
inferredcites →https://doi.org/10.1109/tit.2011.2159049openalex-snapshot
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
inferredcites →https://doi.org/10.1109/tit.2012.2208937openalex-snapshot
On the Locality of Codeword Symbols
inferredcites →https://doi.org/10.1109/tit.2012.2227110openalex-snapshot
Zigzag Codes: MDS Array Codes With Optimal Rebuilding
inferredcites →https://doi.org/10.1109/tit.2014.2321280openalex-snapshot
A Family of Optimal Locally Recoverable Codes
inferredcites →https://doi.org/10.1109/tit.2016.2590429openalex-snapshot
Optimal Exact Repair Strategy for the Parity Nodes of the $(k+2,k)$ Zigzag Code
inferredcites →https://doi.org/10.1109/tit.2017.2661313openalex-snapshot
Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
inferredcites →https://doi.org/10.1109/tit.2017.2702660openalex-snapshot
Repairing Reed-Solomon Codes
inferredcites →https://doi.org/10.1109/tit.2017.2713245openalex-snapshot
New Constructions of Optimal Locally Recoverable Codes via Good Polynomials
inferredcites →https://doi.org/10.1109/tpds.2016.2591040openalex-snapshot
Seek-Efficient I/O Optimization in Single Failure Recovery for XOR-Coded Storage Systems
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1145/2538542.2538562openalex-snapshot
Performance and scalability evaluation of the Ceph parallel file system
inferredcites →https://doi.org/10.1145/2560013openalex-snapshot
Sector-Disk (SD) Erasure Codes for Mixed Failure Modes in RAID Systems
inferredcites →https://doi.org/10.1145/2740070.2626325openalex-snapshot
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
inferredcites →https://doi.org/10.1145/2901318.2901328openalex-snapshot
Partial-parallel-repair (PPR)
inferredcites →https://doi.org/10.1145/3211890.3211896openalex-snapshot
How to Best Share a Big Secret
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.hcc.2025.100339openalex-snapshot
Localitycache: Toward efficient straggler tolerance in LRC-coded storage via caching local parity blocks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103735openalex-snapshot
ZJC: Constructing fully local repair in erasure codes for distributed cloud storage
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103991openalex-snapshot
UMerge: I/O-efficient stripe merging in Locally Repairable Codes with uniform locality
inferred← citeshttps://doi.org/10.1109/access.2021.3107838openalex-snapshot
New Design and Analysis of Error-Resilient LRCs for DSSs With Silent Disk Errors
inferred← citeshttps://doi.org/10.1109/bigdata55660.2022.10020516openalex-snapshot
Optimizing Repair-Cost of Locally Repairable Codes for Hot Data in Cluster Storage Systems
inferred← citeshttps://doi.org/10.1109/ccgrid68966.2026.00064openalex-snapshot
ALTOCUMULUS: Enabling Efficient Erasure Coding in IPFS
inferred← citeshttps://doi.org/10.1109/cscwd68734.2026.11581457openalex-snapshot
LHRepair: Layered Heat–Cold Bandwidth-Aware Repair Scheduling for Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00013openalex-snapshot
ChameleonEC: Exploiting Tunability of Erasure Coding for Low-Interference Repair
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00049openalex-snapshot
Optimal Wide Stripe Generation in Locally Repairable Codes via Staged Stripe Merging
inferred← citeshttps://doi.org/10.1109/icftic59930.2023.10455774openalex-snapshot
Design of flexible Compression Transmission Framework for Distributed Storage System Based on Erasure Coding
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155417openalex-snapshot
On the Optimal Repair-Scaling Trade-off in Locally Repairable Codes
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796704openalex-snapshot
Optimal Data Placement for Stripe Merging in Locally Repairable Codes
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228984openalex-snapshot
Balancing Repair Bandwidth and Sub-Packetization in Erasure-Coded Storage via Elastic Transformation
inferred← citeshttps://doi.org/10.1109/infocom59046.2026.11571631openalex-snapshot
ROE: Repair-Oriented Encoding for Erasure Codes with Localities
inferred← citeshttps://doi.org/10.1109/ipccc59175.2023.10253868openalex-snapshot
Theory vs. Practice in Modeling Edge Storage Systems
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00036openalex-snapshot
Boosting Multi-Block Repair in Cloud Storage Systems with Wide-Stripe Erasure Coding
inferred← citeshttps://doi.org/10.1109/mbits.2024.3362289openalex-snapshot
Data Storage at the Edge: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1109/nas63802.2024.10781348openalex-snapshot
A New Family of Wide Locally Repairable Codes for Seeking the Trade-off between Fault Tolerance and Repair Degree in Distributed Storage System
inferred← citeshttps://doi.org/10.1109/nvmsa71223.2026.11658874openalex-snapshot
Achieving High-Performance Erasure Code Repair Through DPU Offloading
inferred← citeshttps://doi.org/10.1109/srds64841.2024.00012openalex-snapshot
Harmonizing Repair and Maintenance in LRC-Coded Storage
inferred← citeshttps://doi.org/10.1109/tc.2020.3028353openalex-snapshot
Cluster-Aware Scattered Repair in Erasure-Coded Storage: Design and Analysis
inferred← citeshttps://doi.org/10.1109/tc.2023.3234215openalex-snapshot
Optimal Rack-Coordinated Updates in Erasure-Coded Data Centers: Design and Analysis
inferred← citeshttps://doi.org/10.1109/tc.2023.3271064openalex-snapshot
MDTUpdate: A Multi-Block Double Tree Update Technique in Heterogeneous Erasure-Coded Clusters
inferred← citeshttps://doi.org/10.1109/tifs.2022.3140924openalex-snapshot
On the Impact of Pollution Attacks on Coding-Based Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/tnet.2024.3367995openalex-snapshot
Parallelized In-Network Aggregation for Failure Repair in Erasure-Coded Storage Systems
inferred← citeshttps://doi.org/10.1109/tpds.2020.2987837openalex-snapshot
Deterministic Data Distribution for Efficient Recovery in Erasure-Coded Storage Systems
inferred← citeshttps://doi.org/10.1109/tpds.2021.3087352openalex-snapshot
Optimal Repair-Scaling Trade-off in Locally Repairable Codes: Analysis and Evaluation
inferred← citeshttps://doi.org/10.1109/tpds.2022.3152817openalex-snapshot
Fast Proactive Repair in Erasure-Coded Storage: Analysis, Design, and Implementation
inferred← citeshttps://doi.org/10.1109/tpds.2022.3153061openalex-snapshot
Bandwidth-Aware Scheduling Repair Techniques in Erasure-Coded Clusters: Design and Analysis
inferred← citeshttps://doi.org/10.1109/tpds.2025.3547872openalex-snapshot
Toward Load-Balanced Redundancy Transitioning for Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/tpds.2026.3704880openalex-snapshot
When Server Joins INA: The Resource-Aware Repair Acceleration for Erasure-Coded Storage Systems
inferred← citeshttps://doi.org/10.1109/tr.2024.3447706openalex-snapshot
Toward Efficient Repair for Wide-Stripe Erasure Coding With High Reliability
inferred← citeshttps://doi.org/10.1145/3491062openalex-snapshot
Malicious Node Identification in Coded Distributed Storage Systems under Pollution Attacks
inferred← citeshttps://doi.org/10.1145/3545008.3545014openalex-snapshot
Exploiting Parallelism of Disk Failure Recovery via Partial Stripe Repair for an Erasure-Coded High-Density Storage Server
inferred← citeshttps://doi.org/10.1145/3545008.3545038openalex-snapshot
Repair-Optimal Data Placement for Locally Repairable Codes with Optimal Minimum Hamming Distance
inferred← citeshttps://doi.org/10.1145/3581784.3607072openalex-snapshot
Design Considerations and Analysis of Multi-Level Erasure Coding in Large-Scale Data Centers
inferred← citeshttps://doi.org/10.1145/3626198openalex-snapshot
Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)
inferred← citeshttps://doi.org/10.31274/td-20240617-18openalex-snapshot
Enhancing I/O observability and storage reliability in high-performance computing systems
inferred← citeshttps://doi.org/10.33889/ijmems.2022.7.2.020openalex-snapshot
Optimizing Regeneration Time by Node Selection in Group Repair Code
inferred← citeshttps://doi.org/10.3390/info16090803openalex-snapshot
TFR-LRC: Rack-Optimized Locally Repairable Codes: Balancing Fault Tolerance, Repair Degree, and Topology Awareness in Distributed Storage Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.