Decoding Algorithms of Twisted GRS Codes and Twisted Goppa Codes

  • Huan Sun
  • , Qin Yue*
  • , Xue Jia
  • , Chengju Li*
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, we use extended Euclid's algorithm to propose new decoding algorithms for two classes of maximum distance separable (MDS) twisted generalized Reed-Solomon (TGRS) codes of parameters [n, n-t, t+1] over Bbb Fq. For even t, the algorithms can correct t/2 errors with time complexity O(qn). Moreover, we also give a new decoding algorithm for a class of twisted Goppa codes. For even degree t of a Goppa polynomial, it can also correct t/2 errors, which generalizes a ⌊t-1/2⌋-error-correcting decoding algorithm by Sui and Yue (2023).

Original languageEnglish
Pages (from-to)1018-1027
Number of pages10
JournalIEEE Transactions on Information Theory
Volume71
Issue number2
DOIs
StatePublished - 2025

Keywords

  • MDS code
  • Twisted generalized Reed-Solomon code
  • decoding algorithm
  • twisted Goppa code

Fingerprint

Dive into the research topics of 'Decoding Algorithms of Twisted GRS Codes and Twisted Goppa Codes'. Together they form a unique fingerprint.

Cite this