✳flâneur — a map of the web's best reading

Reed–Solomon error correction

en.wikipedia.org · 14,075 words · saved by 1 readers

Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon in 1960.

Reed–Solomon error correction - Wikipedia Jump to content From Wikipedia, the free encyclopedia Error-correcting codes [[Polynomial code]]<br />Reed–Solomon code"},"block_length":{"wt":"''n''"},"message_length":{"wt":"''k''"},"distance":{"wt":"''n'' − ''k'' + 1"},"alphabet_size":{"wt":"''q'' = ''p''<sup>''m''</sup> ≥ ''n''&nbsp; (''p'' prime)<br />Often ''n'' = ''q'' − 1."},"notation":{"wt":"[''n'', ''k'', ''n'' − ''k'' + 1]<sub>''q''</sub>-code"},"decoding":{"wt":"[[Berlekamp–Massey algorithm|Berlekamp–Massey]]<br />[[Euclidean algorithm|Euclidean]]<br />''et al.''"},"properties":{"wt":"[[max

Explore this link on the map →

related reading