A characterization of optimal constacyclic locally repairable codes
Consider a block code \(C\) of length \(n\). Denote by \([n]\) the set \(\lbrace 1, 2,\ldots,n\rbrace\). A linear code with parameters of code length \(n\), dimension \(k\) and minimum distance \(d\) over a finite field \(\mathbb{F}_q\) is referred to as a \(q\)-ary \([n,k,d]\) linear code. For each \(i \in [n]\), the \(i\)-th symbol has locality \(r\) if there exists an index set \(I_i \subset [n]-\lbrace i\rbrace\) with size at most \(r\) such that the \(i\)-th symbol can be determined by a deterministic function of the code symbols with indices in \(I_i\) . The code \(C\) is said to have (all-symbol) locality \(r\) if every code symbol has locality \(r\). In [\textit{P. Gopalan} et al., IEEE Trans. Inf. Theory 58, No. 11, 6925--6934 (2012; Zbl 1364.94603)] a Singleton-type bound is provided for an \([n,k,d]\) linear code with locality \(r\) \[ d\leq n-k-\lceil \frac{k}{r} \rceil+2, \] where \(\lceil x\rceil\) represents the smallest integer greater than or equal to \(x\). In this paper under review, the authors focus on constacyclic codes that attain equality in the above Singleton-type bound. These codes are \(d\)-optimal, and they are refered as optimal constacyclic LRCs. By considering the optimal constacyclic LRCs of length \(\eta\,p^s\) over finite fields \(\mathbb{F}_{p^m}\), \(s\) is a positive integer and \(\eta\) is a positive integer coprime to \(p\), the authors obtain several infinite classes of optimal constacyclic LRCs with new parameters. Furthermore, they completely characterize all the optimal constacyclic LRCs of length \(\eta\, p^s\) when \(x^\eta- \lambda_0\) is irreducible over \(F_{p^m}\).
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
- Optimal cyclic \((r, \delta )\) locally repairable codes with unbounded length
- Constacyclic locally recoverable codes from their duals
- scientific article; zbMATH DE number 7378653
- A family of codes with variable locality and availability
- A Family of Optimal Locally Recoverable Codes
- A note on negacyclic and cyclic codes of length \(p^s\) over a finite field of characteristic \(p\)
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Bounds for Binary Linear Locally Repairable Codes via a Sphere-Packing Approach
- Bounds on the size of locally recoverable codes
- Constacyclic codes of length \(kl^{m}p^{n}\) over a finite field
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- Constructions of Optimal Cyclic $({r},{\delta })$ Locally Repairable Codes
- Constructions of optimal locally repairable codes over small fields
- Fundamentals of Error-Correcting Codes
- How Long Can Optimal Locally Repairable Codes Be?
- Locally recoverable codes from algebraic curves and surfaces
- Network Coding for Distributed Storage Systems
- New Optimal Cyclic Locally Recoverable Codes of Length n=2(q+1)
- On repeated-root cyclic codes
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- On the Locality of Codeword Symbols
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
- Optimal Locally Repairable Codes Via Elliptic Curves
- Optimal quaternary \((r,\delta)\)-locally recoverable codes: their structures and complete classification
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Repeated-root constacyclic codes of length
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Some Repeated-Root Constacyclic Codes Over Galois Rings
- A family of codes with variable locality and availability
- Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
- Constacyclic locally recoverable codes from their duals
- Some new constructions of optimal and almost optimal locally repairable codes
- Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
This page was built for publication: A characterization of optimal constacyclic locally repairable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204325)
