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