REDUNDANCY IN BINARY PATTERNS,

Abstract

Suppose that it is desired to assign a measure of information, average information per symbol, or redundancy to a finite-length sequence of symbols. Two approaches to this problem are considered. The sequence can be treated as a representative sample from a Markov information source, and the average information content per symbol can be determined for the source. The second method is to consider the sequence as a sample space from which subsequences can be randomly selected. A measure of information content can be determined from the subsequence probabilities. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 05, 1967
Accession Number
AD0661228

Entities

People

  • William H. Jermann

Organizations

  • Navy Underwater Sound Laboratory

Tags

DTIC Thesaurus Topics

  • Probability
  • Redundancy
  • Sequences

Readers

  • Computer Vision.
  • Radio communications and signal processing.
  • Statistical inference.

Technology Areas

  • Space