Pages that link to "Item:Q2989710"
From MaRDI portal
The following pages link to On the Locality of Codeword Symbols (Q2989710):
Displayed 50 items.
- A study of the performance of novel storage-centric repairable codes (Q258553) (← links)
- Higher Hamming weights for locally recoverable codes on algebraic curves (Q285459) (← links)
- Optimal RS-like LRC codes of arbitrary length (Q780366) (← links)
- Hamming and simplex codes for the sum-rank metric (Q782849) (← links)
- Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
- Recursive methods for some problems in coding and random permutations (Q831746) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Anticode-based locally repairable codes with high availability (Q1696053) (← links)
- Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
- Architecture-aware coding for distributed storage: repairable block failure resilient codes (Q1784988) (← links)
- Locally recoverable codes from rational maps (Q1800694) (← links)
- Locally recoverable \(J\)-affine variety codes (Q1987102) (← links)
- RS-like locally recoverable codes with intersecting recovering sets (Q1994945) (← links)
- Good polynomials for optimal LRC of low locality (Q2035459) (← links)
- Locally repairable codes with high availability based on generalised quadrangles (Q2070258) (← links)
- The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes (Q2084990) (← links)
- Johnson graph codes (Q2099157) (← links)
- Infinite families of optimal linear codes and their applications to distributed storage systems (Q2103140) (← links)
- On the locality of quasi-cyclic codes over finite fields (Q2115744) (← links)
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes (Q2132450) (← links)
- Optimal cyclic locally repairable codes with unbounded length from their zeros (Q2144525) (← links)
- Locally recoverable codes from algebraic curves with separated variables (Q2176292) (← links)
- Linear programming bounds for distributed storage codes (Q2176298) (← links)
- Linearized decomposition codes and finite integer set coverings (Q2198389) (← links)
- Two classes of optimal LRCs with information \((r, t)\)-locality (Q2200511) (← links)
- Constructions of optimal locally recoverable codes via Dickson polynomials (Q2200512) (← links)
- The complete hierarchical locality of the punctured simplex code (Q2220763) (← links)
- New bounds on the field size for maximally recoverable codes instantiating grid-like topologies (Q2240731) (← links)
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length (Q2302600) (← links)
- A new piggybacking design for systematic MDS storage codes (Q2334436) (← links)
- Self-repairing codes (Q2340045) (← links)
- Locality of optimal binary codes (Q2406696) (← links)
- On the locality of codeword symbols in non-linear codes (Q2440947) (← links)
- On binary locally repairable codes with distance four (Q2662041) (← links)
- A class of almost MDS codes (Q2668084) (← links)
- Optimal selection for good polynomials of degree up to five (Q2672299) (← links)
- The minimum locality of linear codes (Q2678979) (← links)
- Perfect LRCs and \(k\)-optimal LRCs (Q2697472) (← links)
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification (Q2697492) (← links)
- Constructions of near MDS codes which are optimal locally recoverable codes (Q2701054) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- High-entropy dual functions over finite fields and locally decodable codes (Q4965879) (← links)
- Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields (Q4983542) (← links)
- Locality via Partially Lifted Codes (Q5002648) (← links)
- (Q5009537) (← links)
- (Q5091226) (← links)
- (Q5091259) (← links)
- A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices (Q5099097) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups (Q5206236) (← links)