![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
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.