Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Folded_Reed–Solomon_code> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Folded_Reed–Solomon_code abstract "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. They 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 with many random "phased burst" errors [1]. The list-decoding algorithm for folded RS codes corrects beyond the bound for Reed–Solomon codes achieved by the Guruswami–Sudan algorithm for such phased burst errors.".
- Folded_Reed–Solomon_code wikiPageID "35678144".
- Folded_Reed–Solomon_code wikiPageRevisionID "569383674".
- Folded_Reed–Solomon_code subject Category:Coding_theory.
- Folded_Reed–Solomon_code subject Category:Computational_complexity_theory.
- Folded_Reed–Solomon_code subject Category:Error_detection_and_correction.
- Folded_Reed–Solomon_code comment "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. They 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.".
- Folded_Reed–Solomon_code label "Folded Reed–Solomon code".
- Folded_Reed–Solomon_code sameAs Folded_Reed%E2%80%93Solomon_code.
- Folded_Reed–Solomon_code sameAs Q5464277.
- Folded_Reed–Solomon_code sameAs Q5464277.
- Folded_Reed–Solomon_code wasDerivedFrom Folded_Reed–Solomon_code?oldid=569383674.