EUVIMEDEUVIMED entdecken
Crossref

Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes

Nianqi Tang, Chao Chen, Yunghsiang S. Han

IEEE Communications Letters · 2024-04 · 28 (4) · 759-762

DOI: 10.1109/lcomm.2024.3358055 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Communications Letters, 2024-04. Verfasst von Nianqi Tang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 12 Literaturangaben. Gefördert von: National Key Research and Development Program of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Reed-Solomon (RS) codes are widely used to correct errors and erasures. This letter proposes a fast error and erasure decoding algorithm for RS codes. It achieves the best-known complexity $O(n\log (n-k) + (n-k)\log ^{2}(n-k))$ , where $n, k$ are the code length and dimension, respectively. Furthermore, the proposed method is efficient for practical codes. For decoding RS(255, 223), compared with the existing method, the new algorithm saves 32% field operations.

Förderung

  • National Key Research and Development Program of China

Zitieren

APA

Tang, N., Chen, C., & Han, Y. S. (2024). Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes. IEEE Communications Letters, 28(4), 759-762. https://doi.org/10.1109/lcomm.2024.3358055

Vancouver

Tang N, Chen C, Han YS. Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes. IEEE Communications Letters. 2024;28(4):759-762. doi:10.1109/lcomm.2024.3358055

BibTeX
@article{Tang2024,
  author = {Tang, Nianqi and Chen, Chao and Han, Yunghsiang S.},
  title = {Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes},
  journal = {IEEE Communications Letters},
  year = {2024},
  volume = {28},
  number = {4},
  pages = {759--762},
  doi = {10.1109/lcomm.2024.3358055}
}
Kostenlos starten →