Conference paper
Compression scheme for digital cinema application
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Consider the number of n-bit strings that have exactly the maximum possible program-size complexity that an n-bit string can have. We show that this number is itself an n-bit string with nearly the maximum possible complexity. From this it follows that at least 2n-c n-bit strings have exactly the maximum complexity that it is possible for an n-bit string to have. © 1993.
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
Jianke Yang, Robin Walters, et al.
ICML 2023
Imran Nasim, Michael E. Henderson
Mathematics