This article is cited in 2 papers

Automata Theory

Upper Bound for the Power of an Automaton State Code

Yu. L. Sagalovich


Abstract: An upper bound on the power of an automaton state code is obtained on the basis of two race models for q-stable delay elements. The upper and lower bounds on the power of the automaton state code are compared with the corresponding bounds for ordinary noise-immune block codes, and some new problems are discussed.

UDC: 62-507, 621.391.15

Received: 16.07.1971

 English version: Problems of Information Transmission, 1973, 9:1, 55–63

Bibliographic databases:

• 
•