Perfect LRCs and \(k\)-optimal LRCs (Q2697472): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-022-01148-7 / rank
Normal rank
 
Property / author
 
Property / author: Shutaong Xia / rank
 
Normal rank
Property / author
 
Property / author: Fang-Wei Fu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-022-01148-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4308965115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Size of Locally Recoverable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Locally Repairable Codes With Super-Linear Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3419533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equidistant codes in the Grassmannian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois geometries and coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Locality of Codeword Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Long Can Optimal Locally Repairable Codes Be? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Linear Locally Repairable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Locally Repairable Codes Via Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Locally Repairable Codes and Connections to Matroid Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming bounds for distributed storage codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nonexistence of Perfect Codes over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming-Based Bound for Locally Repairable Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of Optimal Codes With Hierarchical Locality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5681909 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10623-022-01148-7 / rank
 
Normal rank

Latest revision as of 15:45, 28 December 2024

scientific article
Language Label Description Also known as
English
Perfect LRCs and \(k\)-optimal LRCs
scientific article

    Statements

    Perfect LRCs and \(k\)-optimal LRCs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2023
    0 references
    locally repairable codes
    0 references
    perfect LRCs
    0 references
    \(k\)-optimal LRCs
    0 references
    finite geometry
    0 references
    \(q\)-Steiner systems
    0 references
    difference sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references