The equivalence of GRS codes and EGRS codes

04/25/2022
āˆ™
by   Canze Zhu, et al.
āˆ™
0
āˆ™

Generalized Reed-Solomon and extended generalized Reed-Solomon (abbreviation to GRS and EGRS) codes are the most well-known family of MDS codes with wide applications in coding theory and practice. Let š”½_q be the q elements finite field, where q is the power of a prime. For a linear code š’ž over š”½_q with length 2ā‰¤ nā‰¤ q, we prove that š’ž is a GRS code if and only if š’ž is a EGRS code.

READ FULL TEXT

page 1

page 2

page 3

research
āˆ™ 10/21/2022

A class of constacyclic codes are generalized Reed-Solomon codes

Maximum distance separable (MDS) codes are optimal in the sense that the...
research
āˆ™ 06/27/2023

Codes and Orbit Covers of Finite Abelian Groups

It is well known that the discrete analogue of a lattice is a linear cod...
research
āˆ™ 01/09/2023

Codes and modular curves

These lecture notes have been written for a course at the Algebraic Codi...
research
āˆ™ 04/25/2022

The non-GRS properties for the twisted generalized Reed-Solomon code and its extended code

In 2017, Beelen et al. firstly introduced twisted generalized Reed-Solom...
research
āˆ™ 12/28/2021

The complete weight enumerator of the Reed-Solomon code with dimension two or three

It is well-known that Reed-Solomon codes and extended Reed-Solomon codes...
research
āˆ™ 01/08/2018

Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices

We prove that for any positive integers n and k such that nā‰„ kā‰„ 1, there...
research
āˆ™ 04/12/2023

Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries

A local tester for an error correcting code CāŠ†Ī£^n is a tester that makes...

Please sign up or login with your details

Forgot password? Click here to reset