To provide more reliability than a single parity bit can give, an error-detecting coding scheme uses one parity bit for checking all the odd numbered bits and a second parity bit for all the even numbered bits. For a data messages of size 5 bits, find all the possible codewords. What is the Hamming distance of this code? How many errors can it detect and correct? For example 10011 > 1001101 (if even parity is used) Parity check for odd numbered bits Parity check for even numbered bits