Abstract In this paper, we introduce curve-lifted codes over fields of arbitrary characteristic, inspired by Hermitian-lifted codes over$$\mathbb {F}_{2^r}$$ . These codes are designed for locality and availability, and their particular parameters depend on the choice of curve and its properties. Due to the construction, the numbers of rational points of intersection between curves and lines play a key role. To demonstrate that and generate new families of locally recoverable codes (LRCs) with high availabilty, we focus on norm-trace-lifted codes.
more »
« less
Mathematical LoRE: Local Recovery of Erasures - Local recovery using polynomials, curves, surfaces, and liftings
- PAR ID:
- 10523657
- Publisher / Repository:
- IEEE
- Date Published:
- Journal Name:
- IEEE BITS the Information Theory Magazine
- ISSN:
- 2692-4080
- Page Range / eLocation ID:
- 1 to 13
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We show that there are no spurious local minima in the non-convex factorized parametrization of low-rank matrix recovery from incoherent linear measurements. With noisy measurements we show all local minima are very close to a global optimum. Together with a curvature bound at saddle points, this yields a polynomial time global convergence guarantee for stochastic gradient descent from random initialization.more » « less
An official website of the United States government

