Articles in Scholarly Journals [Incomplete List]

1. Information Theoretic Methods for Bioinformatics
   EURASIP Journal on Bioinformatics and Systems Biology, vol. 2007, Article ID 79128, 2 pages, 2007
2. Nonlinear Modeling of Protein Expressions in Protein Arrays
   IEEE Transactions on Signal Processing, vol. 54, no. 6, pp. 2394–2407, 2006
3. The Structure Function and Distinguishable Models of Data
   The Computer Journal, vol. 49, no. 6, pp. 657–664, 2006
4. Minimum Description Length Denoising With Histogram Models
   IEEE Transactions on Signal Processing, vol. 54, no. 8, pp. 2922–2928, 2006
5. Robust denoising of electrophoresis and mass spectrometry signals with minimum description length principle
   FEBS Letters, vol. 570, no. 1-3, pp. 107–113, 2004
6. Classification and feature gene selection using the normalized maximum likelihood model for discrete regression
   Signal Processing, vol. 83, no. 4, pp. 713–727, 2003
7. Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions
   IEEE Communications Letters, vol. 7, no. 1, pp. 33–35, 2003
8. Complexity of simple nonlogarithmic loss functions
   IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 476–484, 2003
9. Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources
   IEEE Transactions on Information Theory, vol. 48, no. 7, pp. 2022–2035, 2002
10. Strong optimality of the normalized ML models as universal codes and information in data
    IEEE Transactions on Information Theory, vol. 47, no. 5, pp. 1712–1717, 2001
11. MDL denoising
    IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2537–2543, 2000
12. Coding and Compression: A Happy Union of Theory and Practice
    Journal of the American Statistical Association, vol. 95, no. 451, p. 986, 2000
13. Discussion of paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe
    The Computer Journal, vol. 42, no. 4, pp. 327–329, 1999
14. Fast universal coding with context models
    IEEE Transactions on Information Theory, vol. 45, no. 4, pp. 1065–1071, 1999
15. The minimum description length principle in coding and modeling
    IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2743–2760, 1998
16. Failure-time prediction
    Journal of Statistical Planning and Inference, vol. 66, no. 2, pp. 193–210, 1998
17. Stochastic Complexity in Learning
    Journal of Computer and System Sciences, vol. 55, no. 1, pp. 89–95, 1997
18. Partially hidden Markov models
    IEEE Transactions on Information Theory, vol. 42, no. 4, pp. 1253–1256, 1996
19. Applications of universal context modeling to lossless compression of gray-scale images
    IEEE Transactions on Image Processing, vol. 5, no. 4, pp. 575–586, 1996
20. Fisher information and stochastic complexity
    IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 40–47, 1996
21. A universal finite memory source
    IEEE Transactions on Information Theory, vol. 41, no. 3, pp. 643–652, 1995
22. Density estimation by stochastic complexity
    IEEE Transactions on Information Theory, vol. 38, no. 2, pp. 315–323, 1992
23. A multiplication-free multialphabet arithmetic code
    IEEE Transactions on Communications, vol. 37, no. 2, pp. 93–98, 1989
24. Measures of mutual and causal dependence between two time series (Corresp.)
    IEEE Transactions on Information Theory, vol. 33, no. 4, pp. 598–601, 1987
25. Complexity of strings in the class of Markov sources
    IEEE Transactions on Information Theory, vol. 32, no. 4, pp. 526–532, 1986
26. Universal coding, information, prediction, and estimation
    IEEE Transactions on Information Theory, vol. 30, no. 4, pp. 629–636, 1984
27. A universal data compression system
    IEEE Transactions on Information Theory, vol. 29, no. 5, pp. 656–664, 1983
28. Tight lower bounds for optimum code length (Corresp.)
    IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 348–349, 1982
29. Universal modeling and coding
    IEEE Transactions on Information Theory, vol. 27, no. 1, pp. 12–23, 1981
30. Minimax codes for finite alphabets (Corresp.)
    IEEE Transactions on Information Theory, vol. 24, no. 3, pp. 389–392, 1978
31. Modeling by shortest data description
    Automatica, vol. 14, no. 5, pp. 465–471, 1978
32. Independent components of relations
    ACM Transactions on Database Systems, vol. 2, no. 4, pp. 317–325, 1977
33. Solution of linear equations with Hankel and Toeplitz matrices
    Numerische Mathematik, vol. 22, no. 5, pp. 361–366, 1974
34. Base d' invariantes et de formes canoniques pour des systèmes dynamiques linéairesBasis von invarianten und kanonischen formen für lineare dynamische systemeOc?o?a ???ap?a????? ? ?a?o???ec??? ?op? ??? ???e???? ???a???ec??? c?c?e?
    Automatica, vol. 10, no. 2, pp. 175–182, 1974
35. Maximum likelihood estimation of parameters in multivariate Gaussian stochastic processes (Corresp.)
    IEEE Transactions on Information Theory, vol. 20, no. 1, pp. 102–104, 1974
36. Réalisation partielle de systèmes au hasardPartielle realisierung zufälliger systeme?ac????a? pea???a??? c?y?a???? c?c?e?
    Automatica, vol. 8, no. 4, pp. 389–396, 1972