Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part I: the regular case

IEEE Transactions on Information Theory

Volumn 46, Issue 7, 2000, Pages 2444-2467

  Shamir, Gil I ^a   Costello Jr , Daniel J ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; IMAGE COMPRESSION; PROBABILITY DENSITY FUNCTION; SET THEORY;

CHANGE DETECTION; OPTIMAL REDUNDANCY; PIECEWISE STATIONARY MEMORYLESS SOURCES; PROBABILITY ASSIGNMENT PROBLEM; PROBABILITY MASS FUNCTION; SEQUENTIAL LOSSLESS CODING; TRANSITION PATH;

IMAGE CODING;

EID: 0034318252     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.887857     Document Type: Article

References (22)

1. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1991.
2. M. Burrows and D. J. Wheeler, A Block-Sorting Lossless Data Compression Algorithm. Palo Alto, ÇA: Digital Systems Res. Ctr., May 1994.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley, 1991.
4. I. Csiszâr and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
5. R. M. Gray, Entropy and Information Theory. New York: SpringerVerlag, 1990.
6. M. Gutman, Asymptotically optimal classification for multiple tests with empirically observed statistics, IEEE Trans. Inform. Theory, vol. 35, pp. 40108, Mar. 1989.
7. R. E. Krichevsky and V. K. Trofimov, The performance of universal encoding, IEEE Trans. Inform. Theory, vol. IT-27, pp. 199-207, Mar. 1981.
8. N. Merhav, On the minimum description length principle for sources with piecewise constant parameters, IEEE Trans. Inform. Theory, vol. 39, pp. 1962-1967, Nov. 1993.
9. N. Merhav and M. Feder, A strong version of the redundancy-capacity theorem of universal coding, IEEE Trans. Inform. Theory, vol. 41, pp. 714-722, May 1995.
10. J. Rissanen, Universal coding, information, prediction, and estimation, IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, July 1984.
11. J. Rissanen and G. G. Langdon Jr., Arithmetic coding, IBM J. Res. Devel, vol. 23, no. 2, pp. 149-162, Mar. 1979.
12. Universal modeling and coding, IEEE Trans. Inform. Theory, vol. IT-27, pp. 12-23, Jan. 1981.
13. B. Y. Ryabko, Twice-universal coding, Probl. Inform. Transm., pp. 173-177, July-Sept. 1984.
14. G. I. Shamir, Universal coding for classes of nonstationary sourcesLower bounds and optimal schemes," Ph.D. dissertation, Dept. Elec. Eng., Univ. Notre Dame, Notre Dame, IN, Apr. 2000.
15. G. I. Shamir and D. J. Costello Jr., Asymptotically optimal low complexity sequential lossless coding for piecewise stationary memoryless sources-Part II: The nonregular case, IEEE Trans. Inform. Theory, submitted for publication.
16. G. I. Shamir and N. Merhav, Low complexity sequential lossless coding for piecewise stationary memoryless sources, IEEE Trans. Inform. Theory, vol. 45, pp. 1498-1519, July 1999.
17. Low complexity sequential lossless coding for piecewise stationary memoryless sources, Proc. 1998 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 1998, p. 47.
18. Y. M. Shtarkov, T. J. Tjalkens, and F. M. J. Willems, Multi-alphabet universal coding of memoryless sources, Probl. Inform. Transm., vol. 31, no. 2, pp. 20-35, Apr.-June 1995.
19. F. M. J. Willems, Coding for a binary independent piecewise-identically-distributed source, IEEE Trans. Inform. Theory, vol. 42, pp. 2210-2217, Nov. 1996.
20. F. M. J. Willems and M. Krom, Live-and-die coding for binary piecewise i.i.d. sources, Proc. 1997 IEEE Int. Symp. Information Theory, Ulm, Germany, June 29-July 4 1997, p. 68.
21. F. M. J. Willems, Y M. Shtarkov, and T. J. Tjalkens, The context-tree weighting method: Basic properties, IEEE Trans. Inform. Theory, vol. 41, pp. 653-664, May 1995.
22. J. Ziv, On classification with empirically observed statistics and universal data compression, IEEE Trans. Inform. Theory, vol. 34, pp. 278-286, Mar. 1988.