Accession Number:
AD0661228
Title:
REDUNDANCY IN BINARY PATTERNS,
Descriptive Note:
Corporate Author:
NAVY UNDERWATER SOUND LAB NEW LONDON CONN
Personal Author(s):
Report Date:
1967-10-05
Pagination or Media Count:
19.0
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
Subject Categories:
- Operations Research
- Cybernetics