R. Ahlswede, N. Cai, and Z. Zhang, "Erasure, list, and detection zeroerror capacities for low noise and a relation to identification," IEEE Trans. Inform. Theory, vol. 42, pp. 52--62, Jan. 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....CSISZ AR: THE METHOD OF TYPES 2513 equal the channel capacity even if the above lower bound is strictly smaller. Other recent works addressing the problem of capacity or its special case of zero undetected error capacity include Merhav, Kaplan, Lapidoth, and Shamai [67] Ahlswede, Cai, and Zhang [9], as well as Telatar and Gallager [77] V. CAPACITY OF ARBITRARILY VARYING CHANNELS AVC s were introduced by Blackwell, Breiman, and Thomasian [15] to model communication situations where the channel statistics ( state ) may vary in an unknown and arbitrary manner during the transmission of a ....

R. Ahlswede, N. Cai, and Z. Zhang, "Erasure, list, and detection zeroerror capacities for low noise and a relation to identification," IEEE Trans. Inform. Theory, vol. 42, pp. 52--62, Jan. 1996.

....other desirable features. For instance, one would like to minimize distortion discontinuities near the block edges, or to minimize another fidelity criterion, and so on. The goal of maximizing lists in lossy source coding is somewhat dual to that of minimizing lists in channel decoding (see, e.g. [3], 4] and references therein) The motivations, however, are substantially different. The main contribution of this paper is in deriving a single letter characterization of the best achievable exponential growth rate of the expected list size as the block length tends to infinity. In particular, ....

....Future Research We have characterized and studied properties of the largest attainable expected list size exponent function in lossy source coding. Possible directions for extending these results are the following. ffl General moments. Analogously to reported work on list channel decoding (e.g. [3], 4] and others) it would be interesting to obtain single letter characterizations of EfL(X) ae g for any ae 0. ffl Large deviations performance. Another performance measure that would be interesting to investigate is the asymptotic behavior of the probability that L(X) e ....

R. Ahlswede, N. Cai, and Z. Zhang,"Erasure, list and detection zero-error capacities for low noise and relation to identification," Proc. IEEE Int. Symp. on Inform. Theory, 1994.

....There is a code concept between the first two, namely that of an erasure code, for which in addition to (1.7) we also have W n (D j ju i ) 0 for i 6= j: 1.9) The zero error erasure capacity C er (W ) has been studied in several papers and recently quite intensively by several authors (c.f. [9]) Until now no single letter formula exists. Quite analogously we can also require (1.9) in conjunction with (1.5) This gives exactly the MDC code defined in part D in terms of W 0 . It is interesting that coding for W 0 is equivalent with matching in products of bipartite graphs (see ....

....up the disjointness of the decoding sets and by requiring in addition to (1.7) W n (D j ju i ) for i 6= j (1.12) we get the concept of a (non randomized) identification code ( 12] Randomization means here that instead of u i 2 X n we allow Q i 2 P(X n ) the set of PD s on X n . In [9] we assumed (1.12) in conjunction with (1.6) that is, zero error probability for misrejection and found that here the second order identification capacity equals the (first order) erasure capacity C er . Now we combine for instance (1.5) and (1.9) that is, identification with zero probability ....

[Article contains additional citation context not shown here]

R. Ahlswede, N. Cai, and Z. Zhang, "Erasure, list and detection zero--error capacities for low noise and a relation to identification", Preprint 93--068, SFB 343 "Diskrete Strukturen in der Mathematik", Universit at Bielefeld, IEEE Trans. on Inf. Theory, Vol. 42, No. 1, 55--62, 1996.

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