Totally self-checking checker for 3 N arithmetic codes

N. Gaitanis · Electronics Letters · 1983

In the letter we present a totally self-checking checker for 3N arithmetic codes for every code length n. This checker is composed of two different parts. The first part of the checker is a modulo 15 residue generator and the second part is a simple totally self-checking checker for 3N arithmetic code with code length 4.

Read the paper · More papers on PaperTik