Code: Difference between revisions

Revision as of 00:32, 11 December 2022

Revision as of 22:58, 3 June 2023

Line 33:

{{Main|Error detection and correction}}

{{See also|Block code}}

Codes may also be used to represent data in a way more resistant to errors in transmission or storage. This so-called [[Error detection and correction|error-correcting code]] works by including carefully crafted redundancy with the stored (or transmitted) data. Examples include [[Hamming code]]s, [[Reed–Solomon]], [[Reed–Muller code|Reed–Muller]], [[Walsh–Hadamard code|Walsh–Hadamard]], [[BCH code|Bose–Chaudhuri–Hochquenghem]], [[Turbo code|Turbo]], [[Binary Golay code|Golay]], [[GoppaAlgebraic geometry code|Goppaalgebraic geometry codes]], [[low-density parity-check code]]s, and [[space–time code]]s.

Error detecting codes can be optimised to detect ''burst errors'', or ''random errors''.