Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
From MaRDI portal
Publication:6618622
DOI10.1007/s10623-024-01423-9MaRDI QIDQ6618622
Publication date: 14 October 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Anticode-based locally repairable codes with high availability
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- Application of optimal \(p\)-ary linear codes to alphabet-optimal locally repairable codes
- The minimum locality of linear codes
- Locality and Availability in Distributed Storage
- Bounds on the Parameters of Locally Recoverable Codes
- Bounds on the Size of Locally Recoverable Codes
- Repair Locality With Multiple Erasure Tolerance
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- A characterization of codes meeting the Griesmer bound
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory
- On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
- On Optimal Locally Repairable Codes With Super-Linear Length
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Optimal Binary Linear Locally Repairable Codes with Disjoint Repair Groups
- Locality and Availability of Array Codes Constructed From Subspaces
- New Bounds and Generalizations of Locally Recoverable Codes With Availability
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
Related Items (1)
This page was built for publication: Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes
