# Locally Recoverable codes with local error detection

## TL;DR

This paper introduces a new model of locally recoverable codes that incorporates local error detection, enhancing error correction capabilities, with detailed analysis of Reed-Solomon and Locally Recoverable Reed-Solomon codes.

## Contribution

It presents a novel model combining local recoverability with local error detection, expanding the applicability of error-correcting codes.

## Key findings

- Enhanced error detection in locally recoverable codes
- Detailed analysis of Reed-Solomon codes within the new model
- Potential improvements in data reliability and recovery

## Abstract

A locally recoverable code is an error-correcting code such that any erasure in a coordinate of a codeword can be recovered from a set of other few coordinates. In this article we introduce a model of local recoverable codes that also includes local error detection. The cases of the Reed-Solomon and Locally Recoverable Reed-Solomon codes are treated in some detail.