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

Po-Ning Chen*, Fady Alajaji

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish
Pages (from-to)293-303
Number of pages11
JournalJournal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an
Volume21
Issue number3
DOIs
StatePublished - 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