General Theory of Noiseless Channels

DOI10.1007/978-3-7091-2872-5MaRDI QIDQ4082679zbMATH OpenOpenAlexFDO

Authors Gyula O. H. Katona

Publication date 1970

Full work available at URL https://doi.org/10.1007/978-3-7091-2872-5

zbMATH Keywords

capacity of a memoryless channelentropyfinite-state channelsquasi-finite decodable codesShannon's theorem on noiseless channelstransmission of signals

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• scientific article; zbMATH DE number 3867211
• Storing and transmitting data. Rudolf Ahlswede's lectures on information theory 1. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm
• Channels which transmit letters of unequal duration
• A Mathematical Theory of Communication
• Transmitting and gaining data. Rudolf Ahlswede's lectures on information theory. Vol. 2. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm

Cited in

(1)

• A combinatorial approach to finding the capacity of the discrete noiseless channel

This page was built for publication: General Theory of Noiseless Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4082679)