Locally Recoverable Codes with availability from a family of fibered surfaces
By: Cecília Salgado, Lara Vicino
We construct Locally Recoverable Codes (LRCs) with availability $2$ from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from the theory of one-variable function fields and from the theory of fibrations on surfaces. When the locality parameter is $r=3$, we obtain a sharp bound on the minimum distance of the codes. In that case, we give a geometric interpretation of our codes in terms of doubly elliptic surfaces. In particular, this provides the first instance of an error correcting code constructed using a (doubly elliptic) K3 surface.
Similar Papers
Locally recoverable codes with multiple recovering sets from maximal curves
Algebraic Geometry
Fixes data errors even when some parts are lost.
Improved bounds and optimal constructions of pure quantum locally recoverable codes
Information Theory
Makes quantum computers store data more reliably.
New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
Information Theory
Fixes lost data in computer storage faster.