A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A code over a finite alphabet is called locally recoverable (LRC) if every symbol in the encoding is a function of a small number (at most r) other symbols. We present a family of LRC codes that attain the maximum possible value of the distance for a given locality parameter and code cardinality. The codewords are obtained as evaluations of specially constructed polynomials over a finite field, and reduce to a Reed-Solomon code if the locality parameter r is set to be equal to the codedoi:10.1109/isit.2014.6874920 dblp:conf/isit/TamoB14 fatcat:phfqvgepo5f7vhzpeausqrd4zu