On the Locality of Codeword Symbols
From MaRDI portal
Publication:2989710
DOI10.1109/TIT.2012.2208937zbMath1364.94603arXiv1106.3625OpenAlexW1993830711MaRDI QIDQ2989710
Sergey Yekhanin, Huseyin Simitci, Parikshit Gopalan, Cheng Huang
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.3625
Related Items (69)
Higher Hamming weights for locally recoverable codes on algebraic curves ⋮ Recursive methods for some problems in coding and random permutations ⋮ Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes ⋮ Optimal cyclic locally repairable codes with unbounded length from their zeros ⋮ On binary locally repairable codes with distance four ⋮ Locality via Partially Lifted Codes ⋮ Locality of optimal binary codes ⋮ Locally recoverable codes from algebraic curves with separated variables ⋮ Linear programming bounds for distributed storage codes ⋮ A class of almost MDS codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal selection for good polynomials of degree up to five ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ A characterization of optimal locally repairable codes ⋮ The minimum locality of linear codes ⋮ Three new constructions of optimal linear codes with few weights ⋮ Near MDS codes of non-elliptic-curve type from Reed-Solomon codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ A construction of optimal locally recoverable codes ⋮ A family of codes with variable locality and availability ⋮ Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes ⋮ Locally recoverable codes from towers of function fields ⋮ New constructions of optimal \((r, \delta)\)-LRCs via good polynomials ⋮ Anticode-based locally repairable codes with high availability ⋮ Constructions of cyclic codes and extended primitive cyclic codes with their applications ⋮ Near MDS codes with dimension 4 and their application in locally recoverable codes ⋮ New infinite families of near MDS codes holding \(t\)-designs ⋮ Linearized decomposition codes and finite integer set coverings ⋮ Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\) ⋮ Two classes of optimal LRCs with information \((r, t)\)-locality ⋮ Constructions of optimal locally recoverable codes via Dickson polynomials ⋮ A characterization of optimal constacyclic locally repairable codes ⋮ Galois geometries and coding theory ⋮ Unnamed Item ⋮ Perfect LRCs and \(k\)-optimal LRCs ⋮ Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification ⋮ Constructions of near MDS codes which are optimal locally recoverable codes ⋮ On the locality of codeword symbols in non-linear codes ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ The complete hierarchical locality of the punctured simplex code ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Locally recoverable \(J\)-affine variety codes ⋮ RS-like locally recoverable codes with intersecting recovering sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Good polynomials for optimal LRC of low locality ⋮ Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups ⋮ Locally recoverable codes from rational maps ⋮ High-entropy dual functions over finite fields and locally decodable codes ⋮ Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length ⋮ Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields ⋮ Locally repairable codes with high availability based on generalised quadrangles ⋮ Outlaw distributions and locally decodable codes ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Hamming and simplex codes for the sum-rank metric ⋮ Computing sharp recovery structures for locally recoverable codes ⋮ The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes ⋮ A new piggybacking design for systematic MDS storage codes ⋮ Self-repairing codes ⋮ Johnson graph codes ⋮ Infinite families of optimal linear codes and their applications to distributed storage systems ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ On the locality of quasi-cyclic codes over finite fields ⋮ A study of the performance of novel storage-centric repairable codes
This page was built for publication: On the Locality of Codeword Symbols
