What if the parity bytes exceed 255? I'm assuming this is done with modular arithmetic, but does mod math work to recover missing data from the parity bits without trial and error? (i.e. is the recovery function a one-to-one mapping in reverse?)<p>I'm not well-versed in modular arithmetic, so excuse me if the answer is obvious to those that are.