Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
From MaRDI portal
Publication:6136721
DOI10.1016/j.ffa.2023.102273arXiv2303.06287OpenAlexW4385735949MaRDI QIDQ6136721
Shutaong Xia, Weijun Fang, Unnamed Author, Fang-Wei Fu
Publication date: 31 August 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.06287
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- Unnamed Item
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Constacyclic codes over finite fields
- Negacyclic duadic codes
- Linear programming bounds for distributed storage codes
- On self-dual constacyclic codes over finite fields
- A \(q\)-polynomial approach to constacyclic codes
- Perfect LRCs and \(k\)-optimal LRCs
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Binary Linear Locally Repairable Codes
- Bounds on the Size of Locally Recoverable Codes
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Fundamentals of Error-Correcting Codes
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- How Long Can Optimal Locally Repairable Codes Be?
- Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
- Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Generalizations of the BCH bound
- The structure of 1-generator quasi-twisted codes and new linear codes
This page was built for publication: Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
