R. Ahlswede, E. Yang, and Z. Zhang, "Identification via compressed data," IEEE Trans. Inform. Theory, vol. 43, pp. 48--70, Jan. 1997.  Home/Search   Document Details and Download   Summary   Related Articles

....probability of correct decoding is where the minimum is for all . Comparing this with Remark iii) to Theorem IV.2 shows that feedback cannot exponentially improve the probability of correct decoding at rates above channel capacity. A recent combinatorial result of Ahlswede, Yang, and Zhang [11] is also easiest to state in terms of types. Their inherently typical subset lemma says, effectively, that given and , there is a finite set such that for sufficiently 2520 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 large , to any there exists a mapping and an type ....

....Their inherently typical subset lemma says, effectively, that given and , there is a finite set such that for sufficiently 2520 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 large , to any there exists a mapping and an type such that (VII.17) While this lemma is used in [11] to prove (the converse part of) a probabilistic result, it is claimed to also yield the asymptotic solution of the general isoperimetric problem for arbitrary finite alphabets and arbitrary distortion measures. C. Continuous Alphabets Extensions of the type concept to continuous alphabets are ....

R. Ahlswede, E. Yang, and Z. Zhang, "Identification via compressed data," IEEE Trans. Inform. Theory, vol. 43, pp. 48--70, Jan. 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC