Coding properties and automorphism groups of two classes of twisted generalized Reed–Solomon codes
摘要
Twisted generalized Reed–Solomon (TGRS) codes as a generalization of generalized Reed–Solomon (GRS) codes have attracted a lot of attention from many researchers in recent years. In this paper, we investigate the conditions for the equality of two classes of TGRS codes with different parameters. Moreover, we construct the permutation automorphism groups of two classes of TGRS codes and show they are quasi-cyclic codes. Finally, building upon the Berlekamp–Massey algorithm for GRS codes, we show a decoding scheme for a class of MDS TGRS codes.