Pages that link to "Item:Q5375529"
From MaRDI portal
The following pages link to Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes (Q5375529):
Displaying 12 items.
- Optimal RS-like LRC codes of arbitrary length (Q780366) (← links)
- Locally recoverable \(J\)-affine variety codes (Q1987102) (← 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)
- The complete hierarchical locality of the punctured simplex code (Q2220763) (← links)
- Perfect LRCs and \(k\)-optimal LRCs (Q2697472) (← links)
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups (Q5206236) (← links)
- Codes for Distributed Storage (Q5863765) (← links)
- New upper bounds and constructions of multi-erasure locally recoverable codes (Q6107451) (← links)
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes (Q6136721) (← links)
- Constacyclic locally recoverable codes from their duals (Q6546491) (← links)