PROBLEMS OF CYBERNETICS, PART II,
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Pagination or Media Count:
A study is made of the class of codings in which substitution is made for each letter of the message alphabet by the corresponding word of the code alphabet. Properties of the finite, infinite, and cyclic one-to-one correspondence of codings are established, and it is proved that the property of the finite one-to-one correspondence of codings is the necessary and sufficient condition for the existence of decoding automata. Various methods are proposed for the construction of such decoding automata with minimal delay. The definition of the decoding automata of normal form is given. Definitions of stable and self-adjusting decoding automata are introduced, and it is proved that the property of a cyclic one-to-one correspondence of codings is the necessary and sufficient condition for the existence of the self-adjusting decoding automata with minimal delay. A method is proposed for constructing such automata. A second method for constructing self-adjusting decoding automata is proposed which is based on supplementing the definition of a decoding automata of normal form in such a manner that it is made self-adjusting.