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.