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.

Keywords

MSC

58F15, 58F17, 53C35

Cite this article

@article{cai-5357,
  author  = {Peter Farkaš and Martin Rakús},
  title   = {Decoding Five Times Extended Reed Solomon Codes Using Syndromes},
  journal = {Computing and Informatics},
  volume  = {39},
  number  = {6},
  pages   = {1311--1335},
  year    = {2020},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2020_6_1311}
}
Download .bib