Multiple related errors of any configuration can be automatically corrected by a class of codes having the property of using two groups of parity bits, one defining the error pattern, the other determining the location of the errors within the block. In particular, error bursts can be corrected with a minimum amount of redundancy. Because each parity-bit group is derived by using maximum-length shift-register sequences, rather than by storing a decoding table, the implementation of these codes is relatively simple, as shown in an example of a three-bit-wide burst-correcting code. An example is given of an application of these codes in a data transmission system where only an even number of bits is likely to be corrupted by a noise burst.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.