We give several families of optimal (r, δ)-locally recoverable codes. Most of the constructions of these codes are new, and they are designed for repairing one position by accessing at most r positions but tolerating other δ − 1 erasures. These results were obtained jointly with C. Galindo and F. Hernando.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados