Skip navigation
Please use this identifier to cite or link to this item:
Title: RS-like locally recoverable codes with intersecting recovering sets
Authors: Rajput C.
Bhaintwal, Maheshanand
Published in: Finite Fields and their Applications
Abstract: A recovering set for a coordinate position i in a code is a set R of other coordinate positions such that the value at the i position can be recovered by accessing the values at coordinate positions in R . A locally recoverable (LRC) code with multiple recovering sets is a code in which for every coordinate position there are more than one recovering set. Such codes have been generally studied with the assumption that the recovering sets are pairwise disjoint. Recently Kruglik et al. [1] have presented a construction of LRC codes in which the recovering sets of a coordinate need not be disjoint. In this paper, we present a construction of such type of codes by using the construction of RS-like LRC codes. Further, using a bound given in [1], we have obtained a bound on the rate of the codes from the present construction. Also, we have presented a sufficient condition for a cyclic code over a finite field to be an LRC code with intersecting recovering sets.
Citation: Finite Fields and their Applications(2020), 68
Issue Date: 2020
Publisher: Academic Press Inc.
Keywords: Intersecting recovering sets
LRC codes with availability
RS-like LRC codes
Finite element method
Cyclic code
Finite fields
ISSN: 10715797
Author Scopus IDs: 57216530687
Author Affiliations: Rajput, C., Department of Mathematics, Indian Institute of Technology Roorkee247667, India
Bhaintwal, M., Department of Mathematics, Indian Institute of Technology Roorkee247667, India
Funding Details: .University Grants Commission, à¤¯à¥‚जीसी: 6405-11-061.Financially supported by University Grants Commission (UGC), India, under grant code 6405-11-061.
Corresponding Author: Bhaintwal, M.; Department of Mathematics, India; email:
Appears in Collections:Journal Publications [MA]

Files in This Item:
There are no files associated with this item.
Show full item record

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.