Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 3/2022

03-02-2022

On the locality of quasi-cyclic codes over finite fields

Published in: Designs, Codes and Cryptography | Issue 3/2022

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A code is said to have locality r if any coordinate value in a codeword of that code can be recovered by at most r other coordinates. In this paper, we have 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. We have obtained a bound on the locality of the code in terms of the weights of the associated polynomials to these circulant matrices. We have 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. We have given a construction of 1-generator quasi-cyclic codes with locality at most r using the zeros of its generator polynomial. Some examples have been given to illustrate the results presented in the paper.
previous article On subset-resilient hash function families
next article The geometric field of linearity of linear sets
Literature
1.
Aydin N., Ray-Chaudhuri D.K.: Quasi-cyclic codes over \(\mathbb{Z}_4\) and some new binary codes. IEEE Trans. Inf. Theory 48(7), 2065–2069 (2002).CrossRef
2.
Barbier M., Chabot C., Quintin G.: On quasi-cyclic codes as a generalization of cyclic codes. Finite Fields Appl. 18(5), 904–919 (2012).MathSciNetCrossRef
3.
Bhaintwal M., Wasan S.K.: On quasi-cyclic codes over \(\mathbb{Z}_q\). Appl. Algebra Eng. Commun. Comput. 20(5–6), 459–480 (2009).CrossRef
4.
Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3–4), 235–265 (1997).MathSciNetCrossRef
5.
6.
Conan J., Seguin G.: Structural properties and enumeration of quasi cyclic codes. Appl. Algebra Eng. Commun. Comput. 4(1), 25–39 (1993).MathSciNetCrossRef
7.
Gao J., Shen L., Fu F.W.: Bounds on quasi-cyclic codes over finite chain rings. J. Appl. Math. Comput. 50(1–2), 577–587 (2016).MathSciNetCrossRef
8.
Gopalan P., Huang C., Simitci H., Yekhanin S.: On the locality of codeword symbols. IEEE Trans. Inf. Theory 58(11), 6925–6934 (2012).MathSciNetCrossRef
9.
Goparaju S., Calderbank R.: Binary cyclic codes that are locally repairable. In: 2014 IEEE International Symposium on Information Theory, pp. 676–680. IEEE (2014).
10.
Gulliver T.A.: Construction of Quasi-Cyclic Codes. University of Victoria, Victoria (1989).
11.
Heijnen P.W.: Some Classes of Linear Codes: Observations About Their Structure, Construction, (Non-) Existence and Decoding. Technische Universiteit Eindhoven, Eindhoven (1999).MATH
12.
Huang P., Yaakobi E., Uchikawa H., Siegel P.H.: Cyclic linear binary locally repairable codes. In: 2015 IEEE Information Theory Workshop (ITW), pp. 1–5 (2015).
13.
Jin L., Kan H., Zhang Y.: Constructions of locally repairable codes with multiple recovering sets via rational function fields. IEEE Trans. Inf. Theory 66, 202–209 (2020).MathSciNetCrossRef
14.
Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes. I. Finite fields. IEEE Trans. Inf. Theory 47(7), 2751–2760 (2001).MathSciNetCrossRef
15.
Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes II: chain rings. Des. Codes Cryptogr. 30(1), 113–130 (2003).MathSciNetCrossRef
16.
Pamies-Juarez L., Hollmann H.D., Oggier F.: Locally repairable codes with multiple repair alternatives. In: 2013 IEEE International Symposium on Information Theory, pp. 892–896. IEEE (2013).
17.
18.
Prakash N., Kamath G.M., Lalitha V., Kumar P.V.: Optimal linear codes with a local-error-correction property. In: 2012 IEEE International Symposium on Information Theory Proceedings, pp. 2776–2780. IEEE (2012).
19.
Rawat A.S., Papailiopoulos D.S., Dimakis A.G., Vishwanath S.: Locality and availability in distributed storage. IEEE Trans. Inf. Theory 62(8), 4481–4493 (2016).MathSciNetCrossRef
20.
21.
22.
Tamo I., Barg A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theory 60(8), 4661–4676 (2014).MathSciNetCrossRef
23.
Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes and their subfield subcodes. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 1262–1266. IEEE (2015).
24.
Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. Int. J. Inf. Coding Theory 3(4), 345–364 (2016).MathSciNetMATH
25.
Tan P., Zhou Z., Yan H., Parampalli U.: Optimal cyclic locally repairable codes via cyclotomic polynomials. IEEE Commun. Lett. 23(2), 202–205 (2018).CrossRef
26.
Zeraatpisheh M., Esmaeili M., Gulliver T.A.: Quasi-cyclic codes: algebraic properties and applications. Comput. Appl. Math. 39(2), 1–21 (2020).MathSciNetCrossRef
Metadata
Title
On the locality of quasi-cyclic codes over finite fields
Publication date
03-02-2022
Published in
Designs, Codes and Cryptography / Issue 3/2022
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-022-01009-3

Other articles of this Issue 3/2022

Designs, Codes and Cryptography 3/2022 Go to the issue

OriginalPaper

Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation

OriginalPaper

Cameron–Liebler k-sets in subspaces and non-existence conditions

OriginalPaper

On subset-resilient hash function families

OriginalPaper

Uniqueness of the inversive plane of order sixty-four

OriginalPaper

Two secondary constructions of bent functions without initial conditions

OriginalPaper

Linear codes from support designs of ternary cyclic codes

Premium Partner

    Image Credits