This work addresses the notion of compression ratios greater than what has been known for random sequential strings in binary and larger radix-based systems as applied to those traditionally found in Kolmogorov complexity.
The research presented in Aspects of Kolmogorov Complexity addresses the fundamental standard of defining randomness as measured by a Martin-Lof level of randomness as found in random sequential binary strings.