Twice-universal simulation of Markov sources and individual sequences
暂无分享,去创建一个
[1] Neri Merhav. Achievable key rates for universal simulation of random data with respect to a set of statistical tests , 2004, IEEE Transactions on Information Theory.
[2] L. B. Boza. Asymptotically Optimal Tests for Finite Markov Chains , 1971 .
[3] Alvaro Martín. Tree models :algorithms and information theoretic properties , 2009 .
[4] P. Whittle,et al. Some Distribution and Moment Formulae for the Markov Chain , 1955 .
[5] N. Merhav,et al. Addendum to "On Universal Simulation of Information Sources Using Training Data , 2005, IEEE Trans. Inf. Theory.
[6] John C. Kieffer,et al. Sample converses in source coding theory , 1991, IEEE Trans. Inf. Theory.
[7] Robert M. Gray,et al. Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion , 1977, IEEE Trans. Inf. Theory.
[8] Andrew Chi-Chih Yao,et al. The complexity of nonuniform random number generation , 1976 .
[9] Abraham Lempel,et al. A sequential algorithm for the universal coding of finite memory sources , 1992, IEEE Trans. Inf. Theory.
[10] Sergio Verdú,et al. Channel simulation and coding with side information , 1994, IEEE Trans. Inf. Theory.
[11] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[12] Fumio Kanaya,et al. Channel simulation by interval algorithm: A performance analysis of interval algorithm , 1999, IEEE Trans. Inf. Theory.
[13] Sergio Verdú,et al. Simulation of random processes and rate-distortion theory , 1996, IEEE Trans. Inf. Theory.
[14] Gadiel Seroussi,et al. On universal types , 2004, IEEE Transactions on Information Theory.
[15] Neri Merhav,et al. Universal Delay-Limited Simulation , 2005, IEEE Transactions on Information Theory.
[16] Neri Merhav,et al. On the estimation of the order of a Markov chain and universal data compression , 1989, IEEE Trans. Inf. Theory.
[17] Neri Merhav,et al. Hierarchical universal coding , 1996, IEEE Trans. Inf. Theory.
[18] Imre Csisźar,et al. The Method of Types , 1998, IEEE Trans. Inf. Theory.
[19] Sanjeev R. Kulkarni,et al. Separation of random number generation and resolvability , 2000, IEEE Trans. Inf. Theory.
[20] I. Csiszár,et al. The consistency of the BIC Markov order estimator , 2000 .
[21] Neri Merhav,et al. On universal simulation of information sources using training data , 2004, IEEE Transactions on Information Theory.
[22] Gadiel Seroussi,et al. Linear time universal coding and time reversal of tree sources via FSM closure , 2004, IEEE Transactions on Information Theory.
[23] T. Cover,et al. A sandwich proof of the Shannon-McMillan-Breiman theorem , 1988 .
[24] Mamoru Hoshi,et al. Interval algorithm for random number generation , 1997, IEEE Trans. Inf. Theory.
[25] Meir Feder,et al. A universal finite memory source , 1995, IEEE Trans. Inf. Theory.
[26] Sergio Verdú,et al. Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.
[27] Neri Merhav,et al. Universal Simulation With Fidelity Criteria , 2009, IEEE Transactions on Information Theory.
[28] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[29] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.