Information channels composed of memoryless components. (English) Zbl 0584.94013

For channels composed of a finite number of memoryless components the author has obtained explicit bounds for the maximum length of n- dimensional codes at any admitted level of the probability of error, valid for all n.
Reviewer: G.Dial


94A40 Channel models (including quantum) in information and communication theory
94A15 Information theory (general)
Full Text: EuDML


[1] K. Winkelbauer: On the coding theorem for decomposable discrete information channels. Kybernetika 7 (1971), 109-123 (Part I), 230-255 · Zbl 0244.94006
[2] K. Winkelbauer: On discrete channels decomposable into memoryless components. Kybernetika S (1972), 114-132. · Zbl 0256.94021
[3] K. Winkelbauer: Information channels with memoryless components. Trans. 7th Prague Conf. on Inform. Theory, Vol. A, Academia, Prague 1977, 559 - 576.
[4] K. Winkelbauer: Discrete communication channels decomposable into finite-memory components. Contributions to Statistics (Jaroslav Hájek Memorial Volume), Academia, Prague 1979, 277-306. · Zbl 0421.94008
[5] K. Winkelbauer: On the asymptotic properties of discrete channels decomposable into stable components. Proc. 2nd Prague Conf. on Asymptotic Statistics, JČMF, Prague 1978, 327-340.
[6] J. Wolfowitz: Coding Theorems of Information Theory. Second edition. Springer-Verlag, Berlin-Heidelberg-New York 1964. · Zbl 0132.39704
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.