Can you provide a simple example of how a Hamming code might detect a single-bit error?

Let's say the data is '1011'. With a Hamming code, we'd add parity bits. The resulting code might be '1011100'. If a single bit is flipped (e.g., '1011' becomes '1001'), the parity check would fail because the parity bit would no longer be correct. The receiver would then know an error occurred.