# A family of codes with variable locality and availability

@article{Carvalho2021AFO, title={A family of codes with variable locality and availability}, author={C. Carvalho and V. Neumann}, journal={ArXiv}, year={2021}, volume={abs/2107.13487} }

In this work we present a class of locally recoverable codes, i.e. codes where an erasure at a position P of a codeword may be recovered from the knowledge of the entries in the positions of a recovery set RP . The codes in the class that we define have availability, meaning that for each position P there are several distinct recovery sets. Also, the entry at position P may be recovered even in the presence of erasures in some of the positions of the recovery sets, and the number of supported… Expand

#### References

SHOWING 1-6 OF 6 REFERENCES

On the Locality of Codeword Symbols

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2012

A tight bound for the locality of parity symbols possible in such codes for a broad class of parameter settings is obtained and it is proved that there is a tradeoff between having good locality and the ability to correct erasures beyond the minimum distance. Expand

Locality and Availability in Distributed Storage

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2016

It is shown that it is possible to construct codes that can support a scaling number of parallel reads while keeping the rate to be an arbitrarily high constant, and that this is possible with the minimum Hamming distance arbitrarily close to the Singleton bound. Expand

Optimal linear codes with a local-error-correction property

- Mathematics, Computer Science
- 2012 IEEE International Symposium on Information Theory Proceedings
- 2012

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message… Expand

Decoding Affine Variety Codes Using Gröbner Bases

- Mathematics, Computer Science
- Des. Codes Cryptogr.
- 1998

It is shown that one can, at least in theory, decode affine variety codes up to half the true minimum distance by using the theory of Gröbner bases. Expand

Affine cartesian codes

- Mathematics, Computer Science
- Des. Codes Cryptogr.
- 2014

The basic parameters of affine evaluation codes defined on a cartesian product of finite sets are computed and the formulas for the minimum distance of various families of evaluation codes are recovered. Expand

Gröbner bases - a computational approach to commutative algebra

- Computer Science, Mathematics
- Graduate texts in mathematics
- 1993

This chapter discusses linear algebra in Residue Class Rings in Vector Spaces and Modules, and first applications of Gr bner Bases. Expand