A characterization of optimal constacyclic locally repairable codes
From MaRDI portal
Publication:6204325
DOI10.1016/j.disc.2024.113901WikidataQ129303295 ScholiaQ129303295MaRDI QIDQ6204325
No author found.
Publication date: 27 March 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Repeated-root constacyclic codes of length
- Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Locally recoverable codes from algebraic curves and surfaces
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- A note on negacyclic and cyclic codes of length \(p^s\) over a finite field of characteristic \(p\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- 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
- Some Repeated-Root Constacyclic Codes Over Galois Rings
- 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
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Network Coding for Distributed Storage Systems
- Constructions of optimal locally repairable codes over small fields
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- New Optimal Cyclic Locally Recoverable Codes of Length $n=2(q+1)$
- How Long Can Optimal Locally Repairable Codes Be?
- Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
- On repeated-root cyclic codes
This page was built for publication: A characterization of optimal constacyclic locally repairable codes
