26-05-2016, 12:57 PM
In telecommunication, Hamming codes are a family of linear error-correcting codes that generalize the Hamming(7,4)-code, and were invented by Richard Hamming in 1950. Hamming codes can detect up to two-bit errors or correct one-bit errors without detection of uncorrected errors. By contrast, the simple parity code cannot correct errors, and can detect only an odd number of bits in error. Hamming codes are perfect codes, that is, they achieve the highest possible rate for codes with their block length and minimum distance of three.
Hamming code is named after R. W. Hamming of Bell Labs. It is a set of error-correction codes which are basically employed to detect and correct bit errors that can happen while moving or storing computer data. Similar to other error-correction codes, Hamming code brings into play the concept of parity and parity bits. Parity bits are the bits which are added to data for checking the validity of data, when it is read or after it has been received in a data transmission. Adding more than one parity bit, results not only in identification of a single bit error in the data unit, but also its location in the data unit.
"In data transmission, the ability of a receiving station to correct errors in the received data is called forward error correction (FEC) and can increase throughput on a data page link when there is a lot of noise present. To enable this, a transmitting station must add extra data (called error correction bits) to the transmission. However, the correction may not always represent a cost saving over that of simply resending the information. Hamming codes make FEC less expensive to implement through the use of a block parity mechanism."
Hamming code is named after R. W. Hamming of Bell Labs. It is a set of error-correction codes which are basically employed to detect and correct bit errors that can happen while moving or storing computer data. Similar to other error-correction codes, Hamming code brings into play the concept of parity and parity bits. Parity bits are the bits which are added to data for checking the validity of data, when it is read or after it has been received in a data transmission. Adding more than one parity bit, results not only in identification of a single bit error in the data unit, but also its location in the data unit.
"In data transmission, the ability of a receiving station to correct errors in the received data is called forward error correction (FEC) and can increase throughput on a data page link when there is a lot of noise present. To enable this, a transmitting station must add extra data (called error correction bits) to the transmission. However, the correction may not always represent a cost saving over that of simply resending the information. Hamming codes make FEC less expensive to implement through the use of a block parity mechanism."
