Optimal ternary locally repairable codes

DOI10.1007/S10623-024-01409-7MaRDI QIDQ6591968zbMATH OpenFDO

Authors Jie Hao, Shutaong Xia, Kenneth W. Shum, Bin Chen, Fangwei Fu, Yi-Xian Yang

Publication date 23 August 2024

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

Full work available at URL https://doi.org/10.1007/S10623-024-01409-7

zbMATH Keywords

coding for distributed storage systemslocalitylocally repairable codessingleton-like bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Recommendations

• Optimal binary and ternary locally repairable codes with minimum distance 6
• A characterization of optimal locally repairable codes
• Locality of optimal binary codes
• Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
• scientific article; zbMATH DE number 7378653

Cites work

• A comment on the weight structure of generator matrices of linear codes
• A Family of Optimal Locally Recoverable Codes
• Almost MDS codes
• An Integer Programming-Based Bound for Locally Repairable Codes
• Anticode-based locally repairable codes with high availability
• Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
• Binary Linear Locally Repairable Codes
• Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
• Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
• Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
• Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
• Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
• How Long Can Optimal Locally Repairable Codes Be?
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
• Locality and Availability in Distributed Storage
• Locally Repairable Codes
• More on the uniqueness of the Golay codes
• Near-MDS codes over some small fields
• On near-MDS codes
• On Optimal Locally Repairable Codes With Super-Linear Length
• On the Locality of Codeword Symbols
• On the uniqueness of the Golay codes
• Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
• Optimal Locally Repairable Codes Via Elliptic Curves
• Repair Locality With Multiple Erasure Tolerance
• The Magma algebra system. I: The user language
• Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes

Cited in

(2)

• Optimal binary and ternary locally repairable codes with minimum distance 6
• On Singleton-type bound of locally repairable codes

This page was built for publication: Optimal ternary locally repairable codes

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