Pages that link to "Item:Q2986212"
From MaRDI portal
The following pages link to A Family of Optimal Locally Recoverable Codes (Q2986212):
Displaying 50 items.
- Higher Hamming weights for locally recoverable codes on algebraic curves (Q285459) (← links)
- Optimal RS-like LRC codes of arbitrary length (Q780366) (← links)
- Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes (Q782861) (← links)
- Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← 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)
- RS-like locally recoverable codes with intersecting recovering sets (Q1994945) (← links)
- Codes for distributed storage from 3-regular graphs (Q2012057) (← links)
- Good polynomials for optimal LRC of low locality (Q2035459) (← links)
- Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes (Q2040316) (← links)
- The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes (Q2084990) (← 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)
- A function field approach toward good polynomials for further results on optimal LRC codes (Q2135563) (← links)
- Coding theory package for Macaulay2 (Q2138423) (← 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)
- Constructions of optimal locally recoverable codes via Dickson polynomials (Q2200512) (← links)
- Codes with locality from cyclic extensions of Deligne-Lusztig curves (Q2200520) (← 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)
- A new minimize matrix computation coding method for distributed storage systems (Q2298412) (← links)
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length (Q2302600) (← links)
- A new piggybacking design for systematic MDS storage codes (Q2334436) (← links)
- Locality of optimal binary codes (Q2406696) (← 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)
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification (Q2697492) (← links)
- Minimum distance and parameter ranges of locally recoverable codes with availability from fiber products of curves (Q2701511) (← 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)
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- Constructing Partial MDS Codes from Reducible Algebraic Curves (Q5020843) (← links)
- Toward good families of codes from towers of surfaces (Q5043429) (← links)
- (Q5091259) (← links)
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups (Q5206236) (← links)
- The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes (Q5232331) (← links)
- (Q5857610) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Codes for Distributed Storage (Q5863765) (← links)
- Codes in the Sum-Rank Metric: Fundamentals and Applications (Q5863766) (← links)
- Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q5875494) (← links)
- A characterization of optimal locally repairable codes (Q6041876) (← links)