gen-briefly-explain-redundancy-and-parity-and-one-common-misconc-9b9f

Briefly explain redundancy and parity and one common misconception about it.

# Redundancy and Parity **Redundancy** is storing extra information beyond what's strictly needed, allowing data recovery if some portion is lost or corrupted. Examples include keeping multiple copies of files or adding error-correction codes. **Parity** is a specific type of redundancy that adds calculated check bits to detect or correct errors. For instance, even parity adds a bit so the total number of 1s is even—if it's odd later, an error occurred. ## Common Misconception **"Parity can fix any errors it detects"** Many people assume that if parity detects an error, it can automatically correct it. In reality, **simple parity can only detect errors, not correct them**. For example, single-bit parity can detect that *something* went wrong, but can't identify *which* bit flipped or fix it. You need more sophisticated schemes (like Hamming codes or RAID parity) to actually correct errors, and even those have limits on how many errors they can fix.