|
Problemy Peredachi Informatsii, 1973, Volume 9, Issue 1, Pages 73–83
(Mi ppi884)
|
|
|
|
This article is cited in 2 scientific papers (total 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.
Received: 16.07.1971
Citation:
Yu. L. Sagalovich, “Upper Bound for the Power of an Automaton State Code”, Probl. Peredachi Inf., 9:1 (1973), 73–83; Problems Inform. Transmission, 9:1 (1973), 55–63
Linking options:
https://www.mathnet.ru/eng/ppi884 https://www.mathnet.ru/eng/ppi/v9/i1/p73
|
Statistics & downloads: |
Abstract page: | 232 | Full-text PDF : | 129 |
|