Error Correction Capability
\[t=\left\lfloor\frac{d_{min}-1}{2}\right\rfloor\]

Variables

tmaximum correctable errors
dminminimum Hamming distance

Description

What is this formula?


The Error Correction Capability equation determines the maximum number of bit errors that a block code can guarantee to correct.


It is one of the most fundamental formulas in coding theory and is directly related to the minimum Hamming distance of a code.


Codes with larger minimum distances can correct more transmission errors.


When to use it


Use this formula when analyzing:


- Error-correcting codes

- Hamming codes

- BCH codes

- Reed–Solomon codes

- Digital communications

- Data storage systems


Example


A code has:


dmin = 7


Formula:


t = floor((dmin−1)/2)


Substitution:


t = floor((7−1)/2)


t = floor(3)


t = 3


Result:


t = 3 errors


The code can guarantee correction of up to three errors per codeword.


Applications


- Coding theory

- Digital communications

- Data transmission

- ECC memory

- Storage devices

- Telecommunications


Note


This formula gives the guaranteed error-correction capability of a code. Actual performance may be better under specific decoding algorithms, but reliable correction of more than t errors cannot generally be guaranteed.

fCalc · Android

Take this formula to fCalc and evaluate it directly on your Android device.

Get it on Google Play

Content language

EnglishSpanish