Systematic construction of self-orthogonal diffuse codes

Abstract

A systematic procedure for constructing binary self-orthogonal diffuse codes is presented. These codes correct both random and burst errors. A lower bound on actual constraint length for this class of codes is found. The given construction procedure generally yields codes that approach the lower bound for large burst error correction and are, therefore, asymptotically optimal.