Abstract

Extending Delsarte's linear programming bound for error correcting codes, this paper obtains a linear programming bound for locally repairable storage codes. The number of variables involved in the bound scales linearity with the size of the code. The bound can also be viewed as a necessary condition for the existence of a storage code and be used to characterise the tradeoff among the costs for storage, repair and update.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.