No article text was recorded for this version.
locality-distance tradeoff
Version 1 of 156 papers88 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the Locality of Codeword Symbols
- Blog: On codes with availability for distributed storage.
- Blog: On the Locality of Codeword Symbols in Non-Linear Codes
- Blog: Cooperative local repair in distributed storage.
- Blog: Locally Rewritable Codes for Resistive Memories
- Blog: XORing Elephants: Novel Erasure Codes for Big Data
- Blog: On locality in distributed storage systems.
- Blog: Bounds on the Parameters of Locally Recoverable Codes
- Blog: Cooperative local repair in distributed storage
- Blog: Replication based storage systems with local repair
- Blog: Fractional Repetition Codes With Flexible Repair From Combinatorial Designs
- Blog: On one generalization of LRC codes with availability
- Blog: Repairing with Zero Skip Cost
- Blog: Optimal locally repairable codes of distance 3 and 4 via cyclic codes
- Blog: On Locality in Distributed Storage Systems
- Blog: Optimal locally repairable codes and connections to matroid theory.
- Blog: Singleton-Optimal LRCs and Perfect LRCs via Cyclic and Constacyclic Codes
- Blog: Cyclic Codes with Locality and Availability
- Blog: Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance
- Blog: Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity
- Blog: Coding with Constraints: Minimum Distance Bounds and Systematic Constructions
- Blog: Relaxed Locally Correctable Codes in Computationally Bounded Channels
- Blog: Capacity of Locally Recoverable Codes
- Blog: Partial MDS Codes with Local Regeneration
- Blog: Bounds and Constructions of Locally Repairable Codes: Parity-check Matrix Approach
- Blog: Bounds and constructions of codes with all-symbol locality and availability
- Blog: Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Blog: Distributed Approximate Computing With Constant Locality
- Blog: Some Improvements on Locally Repairable Codes
- Blog: Constructions of Binary Optimal Locally Repairable Codes via Intersection Subspaces
- Blog: Capacity of Locally Recoverable Codes
- Blog: Maximally Recoverable Codes for Grid-like Topologies
- Blog: Improved Maximally Recoverable LRCs using Skew Polynomials
- Blog: Rate Optimal Binary Linear Locally Repairable Codes with Small Availability
- Blog: Long Optimal or Small-Defect LRC Codes with Unbounded Minimum Distances
- Blog: Bounds on the Rate of Linear Locally Repairable Codes over Small Alphabets
- Blog: Optimal Locally Repairable Codes: An Improved Bound and Constructions
- Blog: Locally Repairable Codes
- Blog: Optimal Locally Repairable Codes via Rank-Metric Codes
- Blog: Codes with Unequal Locality
- Blog: Highly Reliable Product Code for Error Correction
- Blog: Locally Repairable Codes
- Blog: Locally Repairable Codes with Unequal Locality Requirements
- Blog: Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point
- Blog: Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Blog: Locality and availability in distributed storage
- Blog: LDPC Code Design for Distributed Storage: Balancing Repair Bandwidth, Reliability, and Storage Overhead
- Blog: Optimal Locally Repairable Systematic Codes Based on Packings
- Blog: Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and $K-1$
- Blog: Locally Repairable Codes With Unequal Local Erasure Correction
- Blog: Two families of linear codes with desirable properties from some functions over finite fields
- Blog: Bounds and Constructions of Singleton-Optimal Locally Repairable Codes with Small Localities
- Blog: Optimal Locally Repairable Codes and Connections to Matroid Theory
- Blog: An upper bound on the size of locally recoverable codes
- Blog: On the Optimality of Gabidulin-Based LRCs as Codes with Multiple Local Erasure Correction
- Blog: Optimal Repair Layering for Erasure-Coded Data Centers: From Theory to Practice
History & citation
Current · Permanent link
- This direction split from Fundamental Limits of Locally Repairable Codes (84% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_locality_distance_tradeoff_0561d956,
title = {locality-distance tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/locality-distance-tradeoff/rdr_0561d9562dd3428e8d64a44e7e3cd2c9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_locality_distance_tradeoff_0561d956_v1,
title = {locality-distance tradeoff},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/locality-distance-tradeoff/rdr_0561d9562dd3428e8d64a44e7e3cd2c9/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}