Hermitian-Lifted Codes

06/09/2020
by   Hiram H. López, et al.
0

In this paper, we construct codes for local recovery of erasures with high availability and constant-bounded rate from the Hermitian curve. These new codes, called Hermitian-lifted codes, are evaluation codes with evaluation set being the set of 𝔽_q^2-rational points on the affine curve. The novelty is in terms of the functions to be evaluated; they are a special set of monomials which restrict to low degree polynomials on lines intersected with the Hermitian curve. As a result, the positions corresponding to points on any line through a given point act as a recovery set for the position corresponding to that point.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2023

Curve-lifted codes for local recovery using lines

In this paper, we introduce curve-lifted codes over fields of arbitrary ...
research
06/29/2020

Error Correcting Codes, finding polynomials of bounded degree agreeing on a dense fraction of a set of points

Here we present some revised arguments to a randomized algorithm propose...
research
07/28/2021

A family of codes with variable locality and availability

In this work we present a class of locally recoverable codes, i.e. codes...
research
09/29/2021

Quadratic-Curve-Lifted Reed-Solomon Codes

Lifted codes are a class of evaluation codes attracting more attention d...
research
02/16/2023

Detecting and approximating decision boundaries in low dimensional spaces

A method for detecting and approximating fault lines or surfaces, respec...
research
06/25/2019

Isometry-Dual Flags of AG Codes

Consider a complete flag {0} = C_0 < C_1 < ... < C_n = F^n of one-point ...
research
01/17/2020

Design and Analysis of Online Fountain Codes for Intermediate Performance

For the benefit of improved intermediate performance, recently online fo...

Please sign up or login with your details

Forgot password? Click here to reset