Table 4: Bit layout of Hamming code (nonsystematic).

Bit position12345678910111213141516
Encoded data bitsP1P2D1P4D2D3D4P8D5D6D7D8D9D10D11P16

Encoded data coverage (nonsystematic) syndromeP1
P2
P4
P8
P16

The syndrome allows errors to be located and corrected. For example, if parity bits P1, P4, and P8 show an error, the location of the error can be found by 1(P1) + 4(P4) + 8(P8) = 13. Therefore, the error affected data bit 9 (D9) in position 13, shown in bold. The above explanation shows the general algorithm used when implementing Hamming code.