Research on the Construction of Maximum Distance Separable Codes via Arbitrary twisted Generalized Reed-Solomon Codes
<|reference_start|>Research on the Construction of Maximum Distance Separable Codes via Arbitrary twisted Generalized Reed-Solomon Codes: Maximum distance separable (MDS) codes have significant combinatorial and cryptographic applications due to their certain optimality. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Twisted generalized Reed-Solomon (TGRS) codes may not necessarily be MDS. It is meaningful to study the conditions under which TGRS codes are MDS. In this paper, we study a general class of TGRS (A-TGRS) codes which include all the known special ones. First, we obtain a new explicit expression of the inverse of the Vandermonde matrix. Based on this, we further derive an equivalent condition under which an A-TGRS code is MDS. According to this, the A-TGRS MDS codes include nearly all the known related results in the previous literatures. More importantly, we also obtain many other classes of MDS TGRS codes with new parameter matrices. In addition, we present a new method to compute the inverse of the lower triangular Toplitz matrix by a linear feedback shift register, which will be very useful in many research fields.<|reference_end|>
@article{zhao2024research,
    title={Research on the Construction of Maximum Distance Separable Codes via
  Arbitrary twisted Generalized Reed-Solomon Codes},
    author={Chun'e Zhao, Wenping Ma, Tongjiang Yan, Yuhua Sun},
    journal={arXiv preprint arXiv:2408.12049},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.12049},
    primaryClass={cs.IT math.IT}
}