The equivalence of GRS codes and EGRS codes
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