Simple proofs of some theorems on noiseless channels

Research output: Contribution to journalArticle

27 Citations (Scopus)


Shannon's capacity formula for memoryless and finite-state noiseless channels is proved in a simple elementary way, for arbitrary symbol costs; actually, a somewhat stronger result is proved. Further, a simple proof of a version of the noiseless coding theorem is given, based on the properties of entropy and avoiding combinatorial arguments; also, in the familiar proof of the mentioned theorem, a possible simplification is pointed out. Finally, a nearly optimal encoding for finite-state noiseless channels is suggested.

Original languageEnglish
Pages (from-to)285-298
Number of pages14
JournalInformation and Control
Issue number3
Publication statusPublished - Mar 1969

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Simple proofs of some theorems on noiseless channels'. Together they form a unique fingerprint.

  • Cite this