On the public citation graph
Practical Design Considerations for Wide Locally Recoverable Codes (LRCs)
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.1007/s10623-022-01020-8openalex-snapshot
A construction of maximally recoverable codes
inferredcites →https://doi.org/10.1109/isit201530130.2015openalex-snapshot
2015 IEEE International Symposium on Information Theory (ISIT)
inferredcites →https://doi.org/10.1109/lcomm.2019.2921540openalex-snapshot
Uniform Minors in Maximally Recoverable Codes
inferredcites →https://doi.org/10.1109/lcomm.2020.2998587openalex-snapshot
A New Construction of Optimal (r, δ) Locally Recoverable Codes
inferredcites →https://doi.org/10.1109/netcod31948.2014openalex-snapshot
2014 International Symposium on Network Coding (NetCod)
inferredcites →https://doi.org/10.1109/tcomm.2021.3083320openalex-snapshot
Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes
inferredcites →https://doi.org/10.1109/tit.2008.929784openalex-snapshot
2009 IEEE International Symposium on Information Theory (ISIT2009)
inferredcites →https://doi.org/10.1109/tit.2012.2208937openalex-snapshot
On the Locality of Codeword Symbols
inferredcites →https://doi.org/10.1109/tit.2014.2321280openalex-snapshot
A Family of Optimal Locally Recoverable Codes
inferredcites →https://doi.org/10.1109/tit.2014.2332338openalex-snapshot
Explicit Maximally Recoverable Codes With Locality
inferredcites →https://doi.org/10.1109/tit.2016.2518663openalex-snapshot
Bounds on the Parameters of Locally Recoverable Codes
inferredcites →https://doi.org/10.1109/tit.2016.2555813openalex-snapshot
Optimal Locally Repairable Codes and Connections to Matroid Theory
inferredcites →https://doi.org/10.1109/tit.2017.2700859openalex-snapshot
Locally Recoverable Codes on Algebraic Curves
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/tit.2018.2800042openalex-snapshot
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
inferredcites →https://doi.org/10.1109/tit.2019.2901492openalex-snapshot
Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
inferredcites →https://doi.org/10.1109/tit.2020.2990981openalex-snapshot
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
inferredcites →https://doi.org/10.1109/tit.2020.3023110openalex-snapshot
ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
inferredcites →https://doi.org/10.1109/tit.2021.3120016openalex-snapshot
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
inferredcites →https://doi.org/10.1109/tit.2022.3176807openalex-snapshot
Improved Maximally Recoverable LRCs Using Skew Polynomials
inferredcites →https://doi.org/10.1145/3381832openalex-snapshot
On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes
inferredcites →https://doi.org/10.1184/r1/14461768openalex-snapshot
Disk-Adaptive Redundancy: Tailoring Data Redundancy to Disk-Reliability Heterogeneity in Cluster Storage Systems
inferredcites →https://doi.org/10.23919/springsim.2019.8732912openalex-snapshot
High Performance Erasure Coding for Very Large Stripe Sizes
inferredcites →https://doi.org/10.48550/arxiv.2111.03244openalex-snapshot
Maximally recoverable local reconstruction codes from subspace direct sum systems
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.future.2025.108142openalex-snapshot
Efficient disk read and recovery cost reduction approach in heterogeneous liberation-coded storage systems
inferred← citeshttps://doi.org/10.1016/j.future.2026.108562openalex-snapshot
HALO: A scalable framework for hotness-aware coding and transformation-efficient placement
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.103991openalex-snapshot
UMerge: I/O-efficient stripe merging in Locally Repairable Codes with uniform locality
inferred← citeshttps://doi.org/10.1109/2575-8411.2026.00052openalex-snapshot
D ${ }^{2}$ Write: Accelerating Erasure-Coded Writes With Distributed Encoding and Decoupled Transmission
inferred← citeshttps://doi.org/10.1109/ccgrid68966.2026.00064openalex-snapshot
ALTOCUMULUS: Enabling Efficient Erasure Coding in IPFS
inferred← citeshttps://doi.org/10.1109/cisce69494.2026.11504726openalex-snapshot
Parallel Block-Based Binary Locally Repairable Codes for Scalable and Efficient Distributed Storage
inferred← citeshttps://doi.org/10.1109/cluster59342.2025.11186483openalex-snapshot
RAN: Accelerating Data Repair with Available Nodes in Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/hpca57654.2024.00042openalex-snapshot
Rapper: A Parameter-Aware Repair-in-Memory Accelerator for Blockchain Storage Platform
inferred← citeshttps://doi.org/10.1109/icccbda64898.2025.11030435openalex-snapshot
Reducing Multi-Node Repair Bandwidth with ERN-MBR Codes
inferred← citeshttps://doi.org/10.1109/iccd58817.2023.00088openalex-snapshot
Cerasure: Fast Acceleration Strategies For XOR-Based Erasure Codes
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/icdcs60910.2024.00075openalex-snapshot
HGR: A Hybrid Global Graph-Based Recovery Approach for Cloud Storage Systems with Failure and Straggler Nodes
inferred← citeshttps://doi.org/10.1109/icftic68075.2025.11324596openalex-snapshot
A Class of Parallel LRCs Applied in Large-scale Distributed Storage Systems——BRP-LRC
inferred← citeshttps://doi.org/10.1109/icpads60453.2023.00248openalex-snapshot
DW-LRC: A Dynamic Wide-stripe LRC Codes for Blockchain Data Under Malicious Node Scenarios
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/isit57864.2024.10619440openalex-snapshot
On Low Field Size Constructions of Access-Optimal Convertible Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654045openalex-snapshot
Practical MDS Array Codes with Balanced Repair Bandwidth, Disk I/O, and Computational Overhead
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654053openalex-snapshot
Bandwidth Cost of Locally Repairable Convertible Codes in the Global Merge Regime
inferred← citeshttps://doi.org/10.1109/ispa63168.2024.00152openalex-snapshot
Efficient erasure-coded multi-data block update methods for heterogeneous storage environments
inferred← citeshttps://doi.org/10.1109/iwqos61813.2024.10682840openalex-snapshot
Greedy Transfer Planning Search For Improving Repair Throughput of RDP-like Coded Storage Clusters
inferred← citeshttps://doi.org/10.1109/jiot.2025.3614288openalex-snapshot
NStripeMerge: A Storage Performance Improvement Strategy for Distributed Erasure Coded Cluster
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/srds64841.2024.00012openalex-snapshot
Harmonizing Repair and Maintenance in LRC-Coded Storage
inferred← citeshttps://doi.org/10.1109/tcad.2024.3432648openalex-snapshot
Fast Acceleration Strategies for XOR-Based Erasure Codes
inferred← citeshttps://doi.org/10.1109/tcad.2024.3493014openalex-snapshot
CodePM: Parity-Based Crash Consistency for Log-Free Persistent Transactional Memory
inferred← citeshttps://doi.org/10.1109/tcc.2025.3546528openalex-snapshot
RLDR: Reinforcement Learning-Based Fast Data Recovery in Cloud-of-Clouds Storage Systems
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/tr.2024.3447706openalex-snapshot
Toward Efficient Repair for Wide-Stripe Erasure Coding With High Reliability
inferred← citeshttps://doi.org/10.1109/tr.2025.3559109openalex-snapshot
An MDS Code Construction for Optimal Update and Efficient Repair With Linear Subpacketization Level and Small Field Size
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/3655038.3665951openalex-snapshot
Revisiting Erasure Codes: A Configuration Perspective
inferred← citeshttps://doi.org/10.1145/3673038.3673103openalex-snapshot
Designing Non-uniform Locally Repairable Codes for Wide Stripes under Skewed File Accesses
inferred← citeshttps://doi.org/10.1145/3694715.3695981openalex-snapshot
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems
inferred← citeshttps://doi.org/10.1145/3703187.3703307openalex-snapshot
A Repair Pipeline Method for Erasure Codes Based on Complete Node Load Balancing
inferred← citeshttps://doi.org/10.1145/3712285.3759806openalex-snapshot
Make Updates Faster: A Fast Multi-Stripe Updates Framework in Erasure-Coded Storage Clusters
inferred← citeshttps://doi.org/10.1145/3727200.3727211openalex-snapshot
A Call for Research on Storage Emissions
inferred← citeshttps://doi.org/10.1145/3772052.3772223openalex-snapshot
D uo A dmit : Dual-Layer Cache Admission for Load-Balancing Hybrid-Redundancy Block Storage
inferred← citeshttps://doi.org/10.1145/3820773openalex-snapshot
Revisiting Data Updates in Erasure-Coded Storage Clusters
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4400955/v1openalex-snapshot
Cognitive Update and Fast Recovery Using Machine Learning and Parity Delta Shareability for Erasure-Coded Storage Systems
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.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.