Some new constructions of optimal linear codes and alphabet-optimal (r, )-locally repairable codes

DOI10.1007/S10623-024-01423-9MaRDI QIDQ6618622zbMATH OpenFDO

Authors Jing Qiu, Fangwei Fu

Publication date 14 October 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-024-01423-9

zbMATH Keywords

distributed storage systemsGriesmer boundlinear codeslocally repairable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Recommendations

• New constructions of optimal \((r, \delta)\)-LRCs via good polynomials
• Optimal (2, ) locally repairable codes via punctured simplex codes
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
• Constructions of optimal locally repairable codes over small fields

Cites work

• A Bound for Error-Correcting Codes
• A characterization of codes meeting the Griesmer bound
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
• A Family of Optimal Locally Recoverable Codes
• Algebraically punctured cyclic codes
• Anticode-based locally repairable codes with high availability
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Bounds on the Parameters of Locally Recoverable Codes
• Bounds on the size of locally recoverable codes
• Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory
• Cyclotomic Linear Codes of Order 3
• Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
• Locality and Availability in Distributed Storage
• Locality and Availability of Array Codes Constructed From Subspaces
• New Bounds and Generalizations of Locally Recoverable Codes With Availability
• On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
• On Optimal Locally Repairable Codes With Super-Linear Length
• On the Locality of Codeword Symbols
• Optimal binary linear locally repairable codes with disjoint repair groups
• Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
• Repair Locality With Multiple Erasure Tolerance
• The minimum locality of linear codes
• Two-Weight Codes Punctured from Irreducible Cyclic Codes

Cited in

(2)

• Locally repairable codes with multiple repair sets based on packings of block size 4
• Optimal (2, ) locally repairable codes via punctured simplex codes

This page was built for publication: Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618622)