A new generalization of Reed-Solomon codes

05/31/2023
by   Chunlei Liu, et al.
0

A new generalization of Reed-Solomon codes is given. Like Goppa codes, our codes also approach to the Gilbert bound. Nevertheless, decoding these new codes does not require us to know the roots of the minimal polynomial of the syndromes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2018

Reed-Solomon-Gabidulin Codes

We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an...
research
03/18/2022

Zipper Codes

Zipper codes are a framework for describing spatially-coupled product-li...
research
02/27/2022

Submodule codes as spherical codes in buildings

In this paper, we give a generalization of subspace codes by means of co...
research
08/30/2021

Fast Decoding of Union-free Codes

Union-free codes and disjunctive codes are two combinatorial structures,...
research
12/13/2021

Bounds in the Lee Metric and Optimal Codes

In this paper we investigate known Singleton-like bounds in the Lee metr...
research
05/25/2018

Extended Integrated Interleaved Codes over any Field with Applications to Locally Recoverable Codes

Integrated Interleaved (II) and Extended Integrated Interleaved (EII) co...
research
07/17/2020

Decoding up to 4 errors in Hyperbolic-like Abelian Codes by the Sakata Algorithm

We deal with two problems related with the use of the Sakata's algorithm...

Please sign up or login with your details

Forgot password? Click here to reset