.png){kind=icon}
.png){kind=icon}
Return
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes
.png){kind=icon}
OA
AI
DOI：10.1109/TIT.2025.3594174.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, firstly, we study decoding of a general class of twisted generalized Reed-Solomon (TGRS) codes and provide a precise characterization of the key equation for TGRS codes and propose a decoding algorithm. Secondly, we further study decoding of almost-MDS TGRS codes and provide a decoding algorithm. These two decoding algorithms are more efficient in terms of performance compared with the decoding algorithms presented in [Sun et al., IEEE-TIT, 2024] and [Sui et al., IEEE-TIT, 2023] respectively. Moreover, these two optimized decoding algorithms can be applied to the decoding of a more general class of twisted Goppa codes.
Keywords:
Codes
Decoding
Reed-Solomon codes
Vectors
Generators
Sun
Polynomials
Linear codes
Finite element analysis
Training
Twisted generalized Reed-Solomon code
twisted Goppa code
MDS code
almost-MDS code
decoding algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
2.9
Papers:
317
Citations:
0