Data in a frame is typically protected from channel errors by error-correcting codes.
The Johnson bound is a limit on the size of error-correcting codes, as used in coding theory for data transmission or communications.
Pass the resultant bit stream on for further processing such as removal of any error-correcting codes.
Any error-correcting code can be used for error detection.
The actual maximum code rate allowed depends on the error-correcting code used, and may be lower.
See Hamming code for an example of an error-correcting code.
I'd be amazed if the procedures and the error-correcting codes are any different.
It encountered hardware problems so seldom that the automatic error-correcting codes were called on only a couple of times a year.
In coding theory, the repetition code is one of the most basic error-correcting codes.
The intuition in this proof is that polynomials form good error-correcting codes.