Pages that link to "Item:Q5224022"
From MaRDI portal
The following pages link to How Long Can Optimal Locally Repairable Codes Be? (Q5224022):
Displaying 21 items.
- Optimal RS-like LRC codes of arbitrary length (Q780366) (← links)
- Locally recoverable \(J\)-affine variety codes (Q1987102) (← links)
- Optimal cyclic locally repairable codes with unbounded length from their zeros (Q2144525) (← links)
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length (Q2302600) (← links)
- On binary locally repairable codes with distance four (Q2662041) (← links)
- Perfect LRCs and \(k\)-optimal LRCs (Q2697472) (← links)
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification (Q2697492) (← links)
- (Q5857610) (← links)
- Codes for Distributed Storage (Q5863765) (← links)
- Codes in the Sum-Rank Metric: Fundamentals and Applications (Q5863766) (← links)
- A characterization of optimal locally repairable codes (Q6041876) (← links)
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes (Q6136721) (← links)
- A characterization of optimal constacyclic locally repairable codes (Q6204325) (← links)
- Optimal binary and ternary locally repairable codes with minimum distance 6 (Q6499100) (← links)
- On Singleton-type bound of locally repairable codes (Q6542020) (← links)
- Constacyclic locally recoverable codes from their duals (Q6546491) (← links)
- Locally repairable codes with multiple repair sets based on packings of block size 4 (Q6571301) (← links)
- Optimal \((r,\delta )\)-LRCs from monomial-Cartesian codes and their subfield-subcodes (Q6591961) (← links)
- Optimal ternary locally repairable codes (Q6591968) (← links)
- On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
- Optimal \((2, \delta)\) locally repairable codes via punctured simplex codes (Q6651899) (← links)