Coordinate i of an error-correcting code has locality r if its value is determined by some r other coordinates. Recently an optimal trade-off between information locality of linear codes, code distance, and redundancy has been obtained. Furthermore, for linear codes meeting this trade-off, structure theorems were derived. In this work we generalize the trade-off and structure theorems to non-linear codes.
- Error-correcting codes
- Non-linear codes
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics