Five Times Extended Reed-Solomon Codes Applicable in Memory Storage Systems

In this letter it is proved that five times extended Reed-Solomon codes contain an infinite subset of almost MDS codes with parameters: [(q - 1) + 5, (q - 1), 5]
_GF(2m)
which are defined over a finite field GF(2
^m
) where m ≥ 3 is a positive odd integer. The first three of these codes reach an upper bound for linear block code distance for the corresponding codeword lengths and number of information symbols in codewords in existing tables for optimal code parameters [1]. The relevant parts of weight spectra for the first four codes confirm the code parameters.