A family of codes with locality containing optimal codes
From MaRDI portal
Publication:6358586
arXiv2101.07629MaRDI QIDQ6358586FDOQ6358586
Authors: Bruno Andrade, Cicero Carvalho, Victor G. L. Neumann, Antonio Claudio Paschoarelli Veiga 
Publication date: 19 January 2021
Abstract: Locally recoverable codes were introduced by Gopalan et al. in 2012, and in the same year Prakash et al. introduced the concept of codes with locality, which are a type of locally recoverable codes. In this work we introduce a new family of codes with locality, which are subcodes of a certain family of evaluation codes. We determine the dimension of these codes, and also bounds for the minimum distance. We present the true values of the minimum distance in special cases, and also show that elements of this family are "optimal codes", as defined by Prakash et al.
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
This page was built for publication: A family of codes with locality containing optimal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358586)
