Pages that link to "Item:Q5211593"

The following pages link to Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields (Q5211593):

Displaying 18 items.

• Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes (Q2084990) (← 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)
• Codes with locality from cyclic extensions of Deligne-Lusztig curves (Q2200520) (← links)
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length (Q2302600) (← links)
• (Q5009537) (← 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)
• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials (Q6150566) (← links)
• A characterization of optimal constacyclic locally repairable codes (Q6204325) (← links)
• Optimal binary and ternary locally repairable codes with minimum distance 6 (Q6499100) (← links)
• Optimal ternary locally repairable codes (Q6591968) (← links)
• On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
• On finding the largest minimum distance of locally recoverable codes: a graph theory approach (Q6646417) (← links)
• Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials (Q6655743) (← links)