THREE PROOFS FOR THE FUNDAMENTAL THEOREM OF INFORMATION THEORY DISCRETE MEMORYLESS CHANNELS

Abstract

The fundamental theorem of information theory for discrete memoryless channels is treated. Subsequent to some preliminary preparations, describing the decision scheme and average error probability, three proofs of the basic theorem are presented: Feinstein's Proof, Shannon's Proof, and Wolfowitz's Proof. A discussion of the bounds of error probability and their relations to the word length and the converse of the fundamental theorem is included. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1961
Accession Number
AD0262848

Entities

People

  • F.m. Reza

Organizations

  • Syracuse University

Tags

DTIC Thesaurus Topics

  • Ergodic Processes
  • Information Theory
  • Mathematics
  • Probability
  • Stochastic Processes
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Theoretical Analysis.