In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} 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.
In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping m {\displaystyle m} 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.
Source: Wikipedia "Folded Reed–Solomon code" · CC BY-SA 4.0
Share this article: X · Bluesky