×

zbMATH — the first resource for mathematics

On discrete channels decomposable into memoryless components. (English) Zbl 0256.94021

MSC:
94A15 Information theory (general)
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] R. L. Dobrušin: A general formulation of Shannon’s fundamental theorem in information theory. (in Russian). Usp. matem. nauk 14 (1959), 3-104.
[2] A. I. Khinchin: Mathematical foundations of information theory. Dover Publications, New York 1957. · Zbl 0088.10404
[3] J. Nedoma: Capacity of a discrete channel. Transact. First Prague Conf. on Infor. Theory etc. Prague 1957, 143-181. · Zbl 0088.10701
[4] J. Nedoma: On non-ergodic channels. Transact. Second Prague Conf. on Inform. Theory etc. Prague 1960, 363-395. · Zbl 0096.11101
[5] K. Winkelbauer: On discrete information sources. Transact. Third Prague Confer. on Information Theory etc. Prague 1964, 765 - 830. · Zbl 0126.35702
[6] K. Winkelbauer: On the coding theorem for decomposable discrete information channels. Kybernetika 7 (1971), 109-123 (Part I), 230-255 · Zbl 0244.94006 · eudml:28895
[7] K. Winkelbauer: On the regularity condition for decomposable communication channels. Kybernetika 7 (1971), 314-327. · Zbl 0244.94007 · eudml:28382
[8] K. Winkelbauer: On the capacity of decomposable channels. Transact. Sixth Prague Conference on Information Theory etc. held in 1971
[9] J. Wolfowitz: Coding theorems of information theory. Second Berlin 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.