pith. sign in

arxiv: 1812.09147 · v2 · pith:AMMY5TESnew · submitted 2018-12-21 · 💻 cs.IT · math.IT· math.RA

Reed-Solomon-Gabidulin Codes

classification 💻 cs.IT math.ITmath.RA
keywords codeshandreed-solomon-gabidulinalgorithmdecodingdesigndistanceefficient
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.