The von Neumann entropy and information rate for ideal quantum Gibbs ensembles
暂无分享,去创建一个
[1] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[2] A. Connes,et al. Dynamical Entropy of C* Algebras and yon Neumann Algebras , 1987 .
[3] Peter Grassberger,et al. Estimating the information content of symbol sequences and efficient codes , 1989, IEEE Trans. Inf. Theory.
[4] Aaron D. Wyner,et al. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression , 1989, IEEE Trans. Inf. Theory.
[5] P. Shields. Entropy and Prefixes , 1992 .
[6] Benjamin Weiss,et al. Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.
[7] Ioannis Kontoyiannis,et al. Prefixes and the entropy rate for long-range sources , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[8] P. Shields. The Ergodic Theory of Discrete Sample Paths , 1996 .
[9] P. Shields. String matching bounds via coding , 1997 .
[10] Anthony Quas,et al. AN ENTROPY ESTIMATOR FOR A CLASS OF INFINITE ALPHABET PROCESSES , 1999 .
[11] C. Monroe,et al. Experimental entanglement of four particles , 2000, Nature.
[12] B. Julsgaard,et al. Experimental long-lived entanglement of two macroscopic objects , 2001, Nature.