Previous |  Up |  Next

Article

Title: On discrete channels decomposable into memoryless components (English)
Title: Diskrétní kanály rozložitelné v bezpaměťové složky (Czech)
Author: Winkelbauer, Karel
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 8
Issue: 2
Year: 1972
Pages: (114)-132
Summary lang: Czech
.
Category: math
.
MSC: 94A05
MSC: 94A15
idZBL: Zbl 0256.94021
idMR: MR0339887
.
Date available: 2009-09-24T16:23:38Z
Last updated: 2012-06-04
Stable URL: http://hdl.handle.net/10338.dmlcz/124937
.
Reference: [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. MR 0107574
Reference: [2] A. I. Khinchin: Mathematical foundations of information theory.Dover Publications, New York 1957. Zbl 0088.10404, MR 0092709
Reference: [3] J. Nedoma: Capacity of a discrete channel.Transact. First Prague Conf. on Infor. Theory etc. Prague 1957, 143-181. Zbl 0088.10701, MR 0102451
Reference: [4] J. Nedoma: On non-ergodic channels.Transact. Second Prague Conf. on Inform. Theory etc. Prague 1960, 363-395. Zbl 0096.11101, MR 0129055
Reference: [5] K. Winkelbauer: On discrete information sources.Transact. Third Prague Confer. on Information Theory etc. Prague 1964, 765 - 830. Zbl 0126.35702, MR 0166000
Reference: [6] K. Winkelbauer: On the coding theorem for decomposable discrete information channels.Kybernetika 7 (1971), 109-123 (Part I), 230-255 (Part II). Zbl 0244.94006, MR 0300751
Reference: [7] K. Winkelbauer: On the regularity condition for decomposable communication channels.Kybernetika 7 (1971), 314-327. Zbl 0244.94007, MR 0349272
Reference: [8] K. Winkelbauer: On the capacity of decomposable channels.Transact. Sixth Prague Conference on Information Theory etc. held in 1971 (in press).
Reference: [9] J. Wolfowitz: Coding theorems of information theory.Second ed. Berlin 1964. Zbl 0132.39704, MR 0176851
.

Files

Files Size Format View
Kybernetika_08-1972-2_2.pdf 953.4Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo