Burst Bits Correction
Original Publication Date: 1985-Jan-01
Included in the Prior Art Database: 2005-Feb-18
An m bits burst error correction method is disclosed. In this method, a data string is considered to be comprised of m sets of bit sequences, each bit sequence consisting of every m-th bit of the data string. A check block includes m sub-blocks, each having the ability of single error correction and generated from the above respective bit sequence. Suppose m bitsequences in a data bit string, where each of first m bits in its turn has an origin of m bit-sequences, and after that, each of following bits belongs to each of m bit-sequences repeating the same turn of the first m bits, as follows: (Image Omitted) Then, consecutive m bits in any location of data bit string belong necessarily to m bitsequences, every bitsequence of which is different from the others.