5. A method for decoding a data word from a first binary message word, said first message word having been encoded to form a first linear cyclic block code word including said data word and a parity word, wherein fewer than a first predetermined number of bits of said first binary message word may have been corrupted after encoding, comprising: (a) cyclicly shifting one bit of a predetermined second linear block code word one bit position, said second linear block code word consisting of the same number of bits as said first message word; (b) logically comparing the first bit of said first message word with the first bit of a predetermined second binary message word; (c) repeating steps a and b for each next respective sequential bit of said first and second message word, respectively, when comparison of step b determines that the respective bits of said first and second message word are logically equivalent; (d) logically comparing the immediately preceding bit having been cyclicly shifted with the respective bit of said first message word when comparison of step b determines that the respective bits of said first and second message word are not logically equivalent; (e) decreasing a second predetermined number by one when comparison of step d determines that the immediately preceding bit having been cyclicly shifted is logically equivalent to the respective bit of said first message word; (f) increasing said second predetermined number by one when comparison of step d determines that the immediately preceding bit having been cyclically shifted is not logically equivalent to the respective bit of said first message word; (g) comparing said second predetermined number with said first predetermined number and repeating steps a through f for each next respective sequential bit of said first and second message word, respectively, when comparison determines that said second predetermined number is less than said first predetermined number; (h) exclusively ORing the present status of said second linear block code word with the respective sequence of bits of said first message word having already been compared by execution of step b when comparison of step g determines that said second predetermined number is equal to said first predetermined number; (i) logically ANDing the result of step h with a plurality of predetermined third linear block code words; (j) comparing the result of step h with the respective one of the plurality of third linear block code words having generated the result of step i; (k) exclusively ORing the present status of said second linear block code word with the respective one of the plurality of third linear block code words having generated an equality for step j; (l) substituting the result of step k for the present status of said second linear block code word; and (m) repeating steps a through l until a third predetermined number of bits of said first message word have been examined.
7. The method as in claim 5, wherein said linear cyclic block code word comprises a Golay (23, 12) code word and said first predetermined number is 4 said second predetermined number is 3 and said third predetermined number is 23.