EE477: Universal Schemes in Information Theory

References

You can gain access to certain password-protected files by asking the TA.

[Algoet94] P. Algoet, "The Strong Law of Large Numbers for Sequential Decisions Under Uncertainty," IEEE Trans. Inform. Theory, vol. 40, pp. 609 - 633, May 1994.
[CL99] N. Cesa-Bianchi and G. Lugosi, "On prediction of individual sequences," Ann. Stat., vol. 27, no. 6, pp. 1865 - 1895, December 1999.
[Cover66] T. Cover, "Behavior of sequential predictors of binary sequences," in Transactions of the Fourth Prague Conference on Information Theory, Prague, pp. 263 - 272, September 1966.
[DK99] A. Dembo and I. Kontoyiannis. "The asymptotics of waiting times between stationary processes, allowing distortion." Ann. Appl. Probab., 9, pp. 413-429, May 1999.
[Dunham80] J. G. Dunham, "Optimal noiseless coding of random variables (Corresp.)," IEEE Trans. Info. Theory, vol. IT-26, p. 345, May 1980.
[EM02] Y. Ephraim and N. Merhav, "Hidden Markov processes," IEEE Trans. Inform. Theory, vol. 48, pp. 1518 - 1569, June 2002.
[FMVW10] V.F. Farias, C.C. Moallemi, B. Van Roy, and T. Weissman, "Universal Reinforcement Learning," IEEE Trans. Inform. Theory, vol. 56, pp. 2441 - 2454, May 2010.
[FMG92] M. Feder, N. Merhav, and M. Gutman, "Universal prediction of individual sequences," IEEE Trans. Info. Theory, vol. IT-38, pp. 1258 - 1270, July 1992.
[Gray70] R. M. Gray, "Information rates of autoregressive processes," IEEE Trans. Info. Theory, vol. IT-16, pp. 412 - 421, July 1970.
[Gray71] R. M. Gray, "Rate distortion functions for finite-state finite-alphabet Markov sources," IEEE Trans. Info. Theory, vol. IT-17, pp. 127 - 134, March 1971.
[Hannan57] J. F. Hannan, "Approximation to Bayes risk in repeated play," in Contributions to the Theory of Games, vol. 3, Annals of Mathematics Studies, no. 39, pp. 97 - 139, Princeton University Press, 1957.
[LZ99] A. Lapidoth and J. Ziv, "On the Decoding of Convolutional Codes on an Unknown Channel," IEEE Trans. Info. Theory, vol. IT-45, pp. 2321-2332, November 1999.
[LZ77] J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Info. Theory, vol. IT-23, pp. 337 - 343, May 1977.
[LZ78] J. Ziv and A. Lempel, "Compression of individual sequences via variable-rate coding," IEEE Trans. Info. Theory, vol. IT-24, pp. 530 - 536, September 1978.
[MF98] N. Merhav and M. Feder, "Universal prediction," IEEE Trans. Info. Theory, vol. IT-44, pp. 2124 - 2147, October 1998.
[MW09] T. Moon and T. Weissman, "Discrete denoising with shifts," IEEE Trans. Info. Theory, vol. IT-55, pp. 5284-5301, November 2009.
[NS98] D. L. Neuhoff and P. C. Shields, "Simplistic Universal Coding," IEEE Trans. Info. Theory, vol. IT-44, pp. 778 - 781, March 1998.
[OVKW11] E. Ordentlich, K. Viswanathan, M. J. Weinberger, "Twice-universal denoising," HP Labs Technical Report HPL-2011-205, October 2011.
[OWWSM04] E. Ordentlich, T. Weissman, M. Weinberger, Anelia Somekh-Baruch and Neri Merhav, "Discrete Universal Filtering Through Incremental Parsing", DCC2004.
[OW93] D. S. Ornstein and B. Weiss, "Entropy and data compression schemes," IEEE Trans. Info. Theory, vol. IT-39, pp. 78 - 83, January 1993.
[Rissanen82] J. J. Rissanen, "Tight lower bounds for optimum code length (Corresp.)," IEEE Trans. Info. Theory, vol. IT-28, pp. 348 - 349, March 1982.
[Ryzin66] J. Van Ryzin, "The sequential compound decision problem with m W n finite loss matrix," Ann. Math. Stat., vol. 37, pp. 954-975, August 1966.
[Shields98] P. C. Shields, "The Interactions Between Ergodic Theory and Information Theory," IEEE Trans. Info. Theory, vol. IT-44, pp. 2079 - 2093, October 1998.
[VO09] K. Viswanathan and E. Ordentlich, "Lower Limits of Discrete Universal Denoising," IEEE Trans. Info. Theory, vol. IT-55, pp. 1374-1386, March 2009.
[Weissman08] T. Weissman, "How to Filter an Individual Sequence with Feedback," IEEE Trans. Info. Theory, vol. IT-54, pp. 3831-3841, August 2008.
[Witsenhausen80] H. S. Witsenhausen, "Indirect rate distortion problems," IEEE Trans. Inform. Theory, vol. IT-26, pp. 518 - 521, September 1980.
[WM03] T. Weissman and N. Merhav, "On limited-delay lossy coding and filtering of individual sequences," IEEE Trans. Inform. Theory, vol. IT-48, pp. 721 - 733, March 2002.
[WMS01] T. Weissman, N. Merhav, and A. Somekh-Baruch, "Twofold universal prediction schemes for achieving the finite state predictability of a noisy individual binary sequence," IEEE Trans. Inform. Theory, vol. IT-47, pp. 1849 - 1866, July 2001.
[WO03] T.Weissman and E. Ordentlich, "The empirical distribution of rate-constrained codes", HP Labs Tech. Report HPL-2003-253.
[WOSVW03] Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi Sergio Verdu, and Marcello Weinberger, "Universal discrete denoising: Known channel," HP Labs Technical Reports (HPL-2003-29), February 2003.
[WZ89] A. D. Wyner and J. Ziv, "Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression," IEEE Trans. Info. Theory, vol. IT-35, pp. 1250 - 1258, November 1989.
[WZ94] A.D. Wyner and J. Ziv, "The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal," Proceedings of the IEEE, vol. 82 iss. 6, pp. 872-877, June 1994.
[YK96] E. Yang and J. C. Kieffer, "Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm," IEEE Trans. Info. Theory, vol. IT-42, pp. 239 - 245, January 1996.
[Ziv72] J. Ziv, "Coding of sources with unknown statistics -- II: Distortion relative to a fidelity criterion," IEEE Trans. Info. Theory,

vol. IT-18, pp. 389 - 394, May 1972.

Last updated: [an error occurred while processing this directive]