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'' (''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
related reading
- A Mathematical Theory of Communicationpeople.math.harvard.edu
- 18.408 F2022 Lectures 2–3: Error Correcting Codesocw.mit.edu
- Erasure Coding: Backblaze Open Sources Reed-Solomon Codebackblaze.com
- But what are Hamming codes? The origin of error correctionyoutube.com
- WHIR: Reed–Solomon Proximity Testing with Super-Fast Verificationeprint.iacr.org
- Solomonoff's theory of inductive inference - Wikipediaen.wikipedia.org
- 0602157.pdfarxiv.org
- Rate–distortion theory - Wikipediaen.wikipedia.org
- arXiv:quant-ph/0207170v1 30 Jul 2002arxiv.org
- Variable-length encoding - Wikipediaen.wikipedia.org
- Kalman filter - Wikipediaen.wikipedia.org
- Orthogonal frequency-division multiplexing - Wikipediaen.wikipedia.org