How hamming code is different from parity bit?

Hamming code and parity bits are both error-detection mechanisms, but they serve different purposes. A parity bit adds a single bit to a data set to ensure an even or odd number of 1s, allowing for the detection of single-bit errors. In contrast, Hamming code can detect and correct single-bit errors by adding multiple bits, which provide more comprehensive error-correction capabilities. Thus, while parity bits can only indicate the presence of an error, Hamming code can both indicate and correct it.