| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423401 | Discrete Mathematics | 2014 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael Forbes, Sergey Yekhanin,