
Click here for full text:
Achievable Key Rates for Universal Simulation of Random Data with Respect to a Set of Statistical Tests
Merhav, Neri
HPL2002271
Keyword(s): No keywords available.
Abstract: Please Note. This abstract contains mathematical formula which cannot be represented here. We consider the problem of universal simulation of an unknown source from a certain parametric family of discrete memoryless sources, given a training vector X from that source and given a limited budget of purely random key bits. The goal is to generate a sequence of random vectors {Y(subscript i)}, all of the same dimension and the same probability laws as the given training vector X, such that a certain, prescribed set of M statistical tests will be satisfied. In particular, for each statistical test, it is required that for a certain event, E(subscript l), 1 less than or equal to L less than or equal to M, the relative frequency of occurrence of E(subscript l) in Y(subscript 1) Y(subscript N) would converge, as N tends to infinity, to a random variable (depending on X), that is typically as close as possible to the expectation of the indicator function 1(subscript E(subscript l) (X) of E(subscript l) with respect to (w.r.t.) the true unknown source, namely, to the probability of the event E(subscript l). We characterize the minimum key rate needed for this purpose and demonstrate how this minimum can be approached in principle. Notes:
25 Pages
Back to Index
