On the locality of quasi-cyclic codes over finite fields

DOI10.1007/S10623-022-01009-3MaRDI QIDQ2115744zbMATH OpenOpenAlexWikidataFDO

Authors Charul Rajput, Maheshanand Bhaintwal

Publication date 21 March 2022

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

Full work available at URL https://doi.org/10.1007/s10623-022-01009-3

zbMATH Keywords

1-generator QC codeslocalityLRC codesQC codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Other types of codes (94B60)

Review text

A code is said to have locality \(r\) if any coordinate value in its codeword can be recovered by at most \(r\) other coordinates. In the paper under review, the authors studied the locality of quasi-cyclic codes over finite fields. The generator matrix of a quasi-cyclic code can be represented in the form of circulant matrices. They also obtained a bound on the locality of the code in terms of the weights of the associated polynomials to these circulant matrices. The paper further analyzed the bounds on the locality, particularly in the case of \(1\)-generator quasi-cyclic codes. An algorithm to find the locality of a quasi-cyclic code is also presented. Also, the authors gave a construction of \(1\)-generator quasi-cyclic codes with locality at most \(r\) using the zeros of its generator polynomial. Some examples are given to illustrate the results presented in the paper.

Recommendations

• On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)
• Quasi-cyclic codes
• On quasi-cyclic codes as a generalization of cyclic codes
• Quasi-cyclic codes over the ring \(\mathbb{F}_p[u]/\langle u^2-u \rangle\)
• Structural properties and enumeration of 1-generator generalized quasi-cyclic codes

Cites work

• A Class of 1-Generator Quasi-Cyclic Codes
• A Family of Optimal Locally Recoverable Codes
• Binary Linear Locally Repairable Codes
• Bounds on quasi-cyclic codes over finite chain rings
• Constructions of Locally Repairable Codes With Multiple Recovering Sets via Rational Function Fields
• Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
• scientific article; zbMATH DE number 1324022 (Why is no real title available?)
• Locality and Availability in Distributed Storage
• Locally Repairable Codes
• New ternary quasi-cyclic codes with better minimum distances
• On quasi-cyclic codes as a generalization of cyclic codes
• On quasi-cyclic codes over \({\mathbb{Z}_q}\)
• On the algebraic structure of quasi-cyclic codes .I. Finite fields
• On the algebraic structure of quasi-cyclic codes. II: Chain rings
• On the Locality of Codeword Symbols
• Quasi-cyclic codes over Z/sub 4/ and some new binary codes
• Quasi-cyclic codes: algebraic properties and applications
• Some results on quasi-cyclic codes
• Structural properties and enumeration of quasi cyclic codes
• The Magma algebra system. I: The user language

Cited in

(3)

• Codes with locality from cyclic extensions of Deligne-Lusztig curves
• Cyclic and Convolutional Codes With Locality
• A construction of optimal quasi-cyclic locally recoverable codes using constituent codes

Describes a project that uses

Uses Software

• Magma

This page was built for publication: On the locality of quasi-cyclic codes over finite fields

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