Error control is a method that can be used to recover the corrupted data whenever possible.

Two basic types of error control

Backward error control - the data is encoded so that the encoded data contains additional redundant
information which is used to detect the corrupted blocks of data that must be resent.
Forward error control. forward error control (FEQ),-the data is encoded so that it contains enough redundant
information to recover from some communications errors. Requires a one-directional channel only

Error control resolves itself into three problems.

First, there is the problem of error prevention.

Second, there is the problem of error detection, and
third, there is the problem of error correction. Error control in data systems is not a new subject.
Considerable effort has been directed toward the control of data errors perhaps long before the invention of
the Quill pen. The advent of digital computers and the associated Data communication systems, however,
has now introduced some new sources of errors into data processing.

Automatic repeat request (ARQ)- can always repair any errors it can detect but it causes a variable delay on the data
transfer.
Basic types of ARQ

idle RQ

continuous RQ
Idle RQ -is a fundamental backward correction scheme used in many protocols.
- Idle RQ is very simple but it is often too inefficient. It can only send data to one direction at a time.
Continuous RQ- is an improvement over Idle RQ when there is a delay on the data transfer. It allows several packets
to be sent continuously.
Hamming single-bit is a block code in which each block is separate from each other. The input block size can be
made as small as necessary
Hamming distance - The minimum number of bits that differ on all possible codewords.
Convolutional forward error correction- in the convolutional forward error correction, the encoded data depends on
both the current data and the previous data.
convolutinal encoder- contains a shift register that is shifted each time a new bit is added.
Constraint length- The length of the shift register and it contains the memory of the encoder.
Viterbi algorithm- it is used in decoding that tries to find the best solution for the decoding.
Golay forward error correction
Golay codes are block codes that allow short codewords. The perfect Golay code is an encoding that encodes 12 bits
into 23 bits, denoted by (23, 12). It allows the correction of three or fewer single bit errors. It allows the correction of
three or fewer single bit errors. The extended Golay code contains an additional parity bit which allows up to four
errors to be detected. The resulting code is (24,12) which is also known as half-rate Golay code. The decoding can
be performed by using either soft or hard decisions. The soft decisions provide better error correction but requiere
more processing. Golay codes are useful in applications that require low latency and short codeword length.
Therefore, Golay codes are used in real-time applications and radio communications.
Reed-Solomon forward error correction with interleaving
-is a forward error correction scheme that is intended to be used with high-quality video communications. The
encoding is performed by filling a two dimensional array of 128*47 octets, that is, 128 octets in each row containing
124 octets of data and 4 octets of redundant check data.