Single-bit error correcting and burst error locating codes

The error location function of codes was first proposed by Wolf and Elspas in 1963 lying midway between error correction and error detection. In 1982, Dass proposed burst error locating codes. These codes, however, have a problem that they cannot locate burst errors which occur at the boundary of the two adjacent subblocks. From this point, the authors proposed a new class of burst error locating codes indicating an erroneous frame, called single bit error correcting and l-bit burst error locating codes, or SEC-B_lEL codes. Here, the frame is a set of continuous symbols in a codeword and adjacent frames are partially overlapped in order to make any burst errors not exceeding the maximum size of the frame be included in at least one frame. The proposed codes, however, have more check-bits than burst error correcting fire codes for longer information-bit length. This paper proposes a new code design method of the SEC-B_lEL codes having less check-bits than the burst error correcting fire codes.