A combinatorial lemma and Shannon's theorem for binary symmetric channels

DOI10.1007/BF01223728zbMath0544.94012WikidataQ124844137 ScholiaQ124844137MaRDI QIDQ797562

Christoph Hering

Publication date: 1981

Published in: Archiv der Mathematik (Search for Journal in Brave)

zbMATH Keywords

invariantsShannon's theoremaverage error probability of block codesbinary symmetric channelscoloured graphs

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Coloring of graphs and hypergraphs (05C15) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Cites Work

• A Mathematical Theory of Communication
• Unnamed Item

This page was built for publication: A combinatorial lemma and Shannon's theorem for binary symmetric channels