Generalized source coding theorems and hypothesis testing: Part II - Operational limits

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 gener...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Chinese Institute of Engineers Vol. 21; no. 3; pp. 293 - 303
Main Authors Chen, Po-Ning, Alajaji, Fady
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.04.1998
Subjects
AEP
hypothesis testing
Neyman-Pearson error exponent
Shannon theory
source coding theorems
Online AccessGet full text
ISSN0253-3839
2158-7299
DOI10.1080/02533839.1998.9670393

Cover

More Information
Summary: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.
ISSN:0253-3839
2158-7299
DOI:10.1080/02533839.1998.9670393