Folded Reed–Solomon code
id:
folded-reed-solomon-code-198-946927
title:
Folded Reed–Solomon code
text:
In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping 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. Using optimal parameters one can decode with a rate of R, and achieve a decoding radius of 1 − R. The term "folded Reed–Solomon codes" was coined in a paper by V.Y. Krachkovsky with an algorithm that presented Reed–Solomon codes wit
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Folded_Reed%E2%80%93Solomon_code
date created:
date modified:
2024-04-20T08:37:13Z
main entity:
{"identifier":"Q5464277","url":"https://www.wikidata.org/entity/Q5464277"}
image:
fields total:
13
integrity:
13