Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
N. Gaitanis (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: