 Incompressible string

An incompressible string is a string with Kolmogorov complexity equal to its length, so that it has no shorter encodings.Suppose we have the string 12349999123499991234, and we are using a compression method that works by putting a special character into the string (say '@') followed by a value that points to an entry in a lookup table (or dictionary) of repeating values.