Title :
The properties of the essential subtrees of a graph representation of the (m, n) — Codewords
Author :
Butorina, N.B. ; Burkatovskaya, J.B.
Author_Institution :
Appl. Math. & Cybern. Dept., Tomsk State Univ., Tomsk, Russia
Abstract :
This The problem of synthesis of a self-testing checker for an arbitrary number l of (m, n) - codewords is considered. In particular, the problem of representation of number l by the sum of cardinal numbers of subsets of the codewords corresponding to essential subtrees of the tree representing all (m, n) - codewords is investigated. The properties of the essential subtrees are described.
Keywords :
built-in self test; codes; number theory; trees (mathematics); (m, n)-codewords; cardinal numbers; essential subtrees; graph representation; self-testing checker synthesis problem; subsets; Built-in self-test; Circuit faults; Computers; Cybernetics; Educational institutions; Indexes; Single event upset; (m, n); Self-checking circuit; code; self-testing checker;
Conference_Titel :
Strategic Technology (IFOST), 2012 7th International Forum on
Conference_Location :
Tomsk
Print_ISBN :
978-1-4673-1772-6
DOI :
10.1109/IFOST.2012.6357595
