scientific article; zbMATH DE number 3557671

zbMATH Open0357.94025MaRDI QIDQ4133537FDOQ4133537

Authors: S. Z. Stambler 

Publication date: 1975

Full work available at URL: http://mathnet.ru/eng/ppi/v11/i4/p3

Title of this publication is not available (Why is that?)

Recommendations

• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• scientific article; zbMATH DE number 910966
• A class of generalized Shannon-McMillan theorems for arbitrary discrete information source
• scientific article; zbMATH DE number 3575467
• Analytical and Numerical Characterizations of Shannon Ordering for Discrete Memoryless Channels
• A class of Shannon-Mcmillan approximation theorems for arbitrary discrete information source
• A combinatorial lemma and Shannon's theorem for binary symmetric channels
• On the coding theorem and its converse for finite-memory channels
• Entropy inequalities for discrete channels
• Random coding theorems for the general discrete memoryless broadcast channel

zbMATH Keywords

coding theoremschannel state known at the output.complete class of discrete memoryless channelsordinary and randomized codes with mean errorrandomized codes with maximum errorweak converse

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• On the capacity of the arbitrarily varying channel for maximum probability of error
• A combinatorial lemma and Shannon's theorem for binary symmetric channels

This page was built for publication:

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