Folded Reed–Solomon code (original) (raw)

In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping Reed–Solomon codewords over a larger alphabet by careful bundling of codeword symbols. Folded Reed–Solomon codes are also a special case of Parvaresh–Vardy codes. Using optimal parameters one can decode with a rate of R, and achieve a decoding radius of 1 − R.