Bounds on the maximal minimum distance of linear locally repairable codes
Bounds on the maximal minimum distance of linear locally repairable codes
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close connection between almost affine LRCs and matroid theory which can be utilized to construct …