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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chen, PN	en_US
dc.contributor.author	Alajaji, F	en_US
dc.date.accessioned	2014-12-08T15:49:08Z	-
dc.date.available	2014-12-08T15:49:08Z	-
dc.date.issued	1998-05-01	en_US
dc.identifier.issn	0253-3839	en_US
dc.identifier.uri	http://hdl.handle.net/11536/32650	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.subject	Shannon theory	en_US
dc.subject	AEP	en_US
dc.subject	source coding theorems	en_US
dc.subject	hypothesis testing	en_US
dc.subject	Neyman-Pearson error exponent	en_US
dc.title	Generalized source coding theorems and hypothesis testing: Part II - Operational limits	en_US
dc.type	Article	en_US
dc.identifier.journal	JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS	en_US
dc.citation.volume	21	en_US
dc.citation.issue	3	en_US
dc.citation.spage	293	en_US
dc.citation.epage	303	en_US
dc.contributor.department	電信工程研究所	zh_TW
dc.contributor.department	Institute of Communications Engineering	en_US
dc.identifier.wosnumber	WOS:000074038300005	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.