|
Problemy Peredachi Informatsii, 1969, Volume 5, Issue 3, Pages 37–45
(Mi ppi1809)
|
|
|
|
Complexity of the Combinational Unit under Noise-Immune Coding of the States of an Automaton
Yu. L. Sagalovich
Abstract:
Two methods of organizing the combinational unit of an automaton are discussed under noise-immune coding of the (complete or only the internal) states of an automaton. For each method estimates are given for the complexity of the combinational unit, and the limits of applicability are given.
Received: 20.06.1968 Revised: 17.04.1969
Citation:
Yu. L. Sagalovich, “Complexity of the Combinational Unit under Noise-Immune Coding of the States of an Automaton”, Probl. Peredachi Inf., 5:3 (1969), 37–45; Problems Inform. Transmission, 5:3 (1969), 29–34
Linking options:
https://www.mathnet.ru/eng/ppi1809 https://www.mathnet.ru/eng/ppi/v5/i3/p37
|
Statistics & downloads: |
Abstract page: | 220 | Full-text PDF : | 115 |
|