EUVIMEDEUVIMED entdecken
Crossref

Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform

Jiwei Liang, Li Chen

IEEE Transactions on Information Theory · 2026-06 · 72 (6) · 3771-3783

DOI: 10.1109/tit.2026.3678324 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-06. Verfasst von Jiwei Liang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Algebraic codes are important in communication and storage systems where soft information is limited and decoding efficiency is critical. Among them, algebraic-geometric (AG) codes are promising candidates to replace the widely used Reed-Solomon (RS) codes. However, their more sophisticated algebraic structure results in high decoding complexity, hindering their practical application. This paper proposes a novel interpolation-based algebraic soft decoding (ASD) for one of the most important AG codes - Hermitian codes. Given a designed maximum decoding output list size (OLS), the interpolation module is constructed, and the decoding is formulated as finding a desired Gröbner basis of this module that contains the interpolation polynomial. The re-encoding transform (ReT) specifically designed for ASD is proposed, enabling the modified basis reduction (BR) interpolation to achieve lower complexity. The ReT is formulated by defining Lagrange interpolation polynomials over the Hermitian function fields and appropriately choosing the re-encoding points. By exploiting the linear code property, the ReT transforms a subset of interpolation points to have zero $z$ -coordinates, which allows a common factor to be extracted from the module basis polynomials, thereby simplifying the interpolation. This paper further proposes an improved ReT employing more re-encoding points. It enables the common factor to have a greater degree, yielding a more significant complexity reduction. This also leads to an early termination for the decoding. Theoretical analysis and numerical results demonstrate that the two proposed ReT schemes efficiently facilitate the ASD for Hermitian codes.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Guangdong Province

Zitieren

APA

Liang, J., & Chen, L. (2026). Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform. IEEE Transactions on Information Theory, 72(6), 3771-3783. https://doi.org/10.1109/tit.2026.3678324

Vancouver

Liang J, Chen L. Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform. IEEE Transactions on Information Theory. 2026;72(6):3771-3783. doi:10.1109/tit.2026.3678324

BibTeX
@article{Liang2026,
  author = {Liang, Jiwei and Chen, Li},
  title = {Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform},
  journal = {IEEE Transactions on Information Theory},
  year = {2026},
  volume = {72},
  number = {6},
  pages = {3771--3783},
  doi = {10.1109/tit.2026.3678324}
}
Kostenlos starten →