A Generalised Decoding Algorithm For Hamming Codes
V. Sinha · IETE Journal of Research · 1980
Pedagogically Hamming codes are explained for the binary case, where the error location is readily available as a column of the parity-check matrix H. A generalized decoding algorithm for the code for any GF(q) is presented. The special case of no. of parity-check symbols, r=2 is good enough for single-error correction when q>2.