Burst Unidirectional Error-Detecting Codes

Abstract

Systematic codes capable of detecting burst unidrectional errors of length up to 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r−1</sup> using r check bits where r ≥ 3 are presented. Moreover, b-adjacent unidirectional error-detecting codes using [log <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> (b + 1)] check bits are also described. These codes are shown to be optimal or near optimal. The encoding/decoding and the totally self- checking checker design methods for these codes are also given.