Conference paper
Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
By taking into account the Fisher information and removing an inherent redundancy in earlier two-part codes, a sharper code length as the stochastic complexity and the associated universal process are derived for a class of parametric processes. The main condition required is that the maximum-likelihood estimates satisfy the Central Limit Theorem. The same code length is also obtained from the so-called maximum-likelihood code. © 1996 IEEE.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Preeti Malakar, Thomas George, et al.
SC 2012
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science