Abstract
In light of the information measures introduced in Part I, a generalized version of the Asymptotic Equipartition Property (AEP) is proved. General fixed-length data compaction and data compression (source coding) theorems for arbitrary finite-alphabet sources are also established. Finally, the general expression of the Neyman-Pearson type-II error exponent subject to upper bounds on the type-I error probability is examined.
| Original language | English |
|---|---|
| Pages (from-to) | 293-303 |
| Number of pages | 11 |
| Journal | Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an |
| Volume | 21 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jan 1998 |
Keywords
- AEP
- Hypothesis testing
- Neyman-Pearson error exponent
- Shannon theory
- Source coding theorems
Fingerprint
Dive into the research topics of 'Generalized source coding theorems and hypothesis testing: Part II — Operational limits'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver