Decoding Five Times Extended Reed Solomon Codes Using Syndromes

Authors

  • Peter Farkaš Institute of Multimedia ICT, Faculty of Electrical Engineering, Slovak University of Technology, Bratislava & Institute of Applied Informatics, Faculty of Informatics, Pan-European University, Bratislava, Slovakia
  • Martin Rakús Institute of Multimedia ICT, Faculty of Electrical Engineering, Slovak University of Technology, Bratislava, Slovakia

DOI:

https://doi.org/10.31577/cai_2020_6_1311

Keywords:

Algorithm, extended Reed Solomon codes, error correction decoding, syndromes

Abstract

Recently a new family of five times extended Reed Solomon codes constructed over certain finite fields GF(2 zeta), where zeta >= 3 is an odd integer, was discovered. Until now only an erasure decoding algorithm for these codes was published. In this paper a new decoding algorithm is presented, which allows correcting up to two errors in a codeword from the five times extended Reed Solomon codes. The proposed decoding algorithm is based on syndrome usage.

Downloads

Download data is not yet available.

Downloads

Published

2021-05-20

How to Cite

Farkaš, P., & Rakús, M. (2021). Decoding Five Times Extended Reed Solomon Codes Using Syndromes. Computing and Informatics, 39(6), 1311–1335. https://doi.org/10.31577/cai_2020_6_1311

Issue

Vol. 39 No. 6 (2020): Computing and Informatics

Section

Articles