Reed-Solomon-Gabidulin Codes

12/21/2018
by   Xavier Caruso, et al.
0

We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal distance and design an efficient decoding algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2023

A new generalization of Reed-Solomon codes

A new generalization of Reed-Solomon codes is given. Like Goppa codes, o...
research
12/14/2021

Right-hand side decoding of Gabidulin code and applications

We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We...
research
08/30/2021

Fast Decoding of Union-free Codes

Union-free codes and disjunctive codes are two combinatorial structures,...
research
07/23/2022

Improving the Reliability of Next Generation SSDs using WOM-v Codes

High density Solid State Drives, such as QLC drives, offer increased sto...
research
07/28/2022

Skew differential Goppa codes and their application to McEliece cryptosystem

A class of linear codes that extends classic Goppa codes to a non-commut...
research
03/18/2022

Zipper Codes

Zipper codes are a framework for describing spatially-coupled product-li...
research
03/25/2020

A CRC-aided Hybrid Decoding for Turbo Codes

Turbo codes and CRC codes are usually decoded separately according to th...

Please sign up or login with your details

Forgot password? Click here to reset