Locally Recoverable codes from algebraic curves with separated variables

06/07/2018
by   Carlos Munuera, et al.
0

A Locally Recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. We study Locally Recoverable Algebraic Geometry codes arising from certain curves defined by equations with separated variables. The recovery of erasures is obtained by means of Lagrangian interpolation in general, and simply by one addition in some particular cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2018

Locally Recoverable codes with local error detection

A locally recoverable code is an error-correcting code such that any era...
research
07/11/2019

Computing sharp recovery structures for Locally Recoverable codes

A locally recoverable code is an error-correcting code such that any era...
research
10/29/2019

Locally recoverable codes on surfaces

A linear error correcting code is a subspace of a finite dimensional spa...
research
07/15/2018

Codes with hierarchical locality from covering maps of curves

Locally recoverable (LRC) codes provide ways of recovering erased coordi...
research
08/29/2023

Lower Rate Bounds for Hermitian-Lifted Codes for Odd Prime Characteristic

Locally recoverable codes are error correcting codes with the additional...
research
10/21/2021

How arithmetic and geometry make error correcting codes better

This note completes a talk given at the conference Curves over Finite Fi...
research
02/02/2021

Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings

Let k,p∈ℕ with p prime and let f∈ℤ[x_1,x_2] be a bivariate polynomial wi...

Please sign up or login with your details

Forgot password? Click here to reset