Can you explain the process of calculating parity bit positions in a Hamming Code?

Parity bit positions are always powers of 2 (1, 2, 4, 8, 16, etc.). Each parity bit checks a specific set of data bits. To determine which data bits a parity bit checks, write the position of each data bit in binary. If the binary representation of the data bit position has a '1' in the same position as the parity bit's position (in binary), then that data bit is included in the parity calculation for that parity bit.