Classical error correction The key idea:redundancy (cloning unknown information) 0→000 1→111 Suppose the noise flips the bit with probability p>0 1-p 0 0 1 1-p Decode the information by majority voting,then The probability that two or more of the bits are flipped:3p2-2p This is smaller than the original,whenever p<1/2
The key idea: redundancy (cloning unknown information)
Suppose the noise flips the bit with probability
Decode the information by majority voting, then ◦ The probability that two or more of the bits are flipped: ◦ This is smaller than the original, whenever