<s>
An	O
incompressible	B-Algorithm
string	I-Algorithm
is	O
a	O
string	O
with	O
Kolmogorov	O
complexity	O
equal	O
to	O
its	O
length	O
,	O
so	O
that	O
it	O
has	O
no	O
shorter	O
encodings	O
.	O
</s>
<s>
Suppose	O
we	O
have	O
the	O
string	O
12349999123499991234	O
,	O
and	O
we	O
are	O
using	O
a	O
compression	B-General_Concept
method	O
that	O
works	O
by	O
putting	O
a	O
special	O
character	O
into	O
the	O
string	O
(	O
say	O
'	O
@	O
 '	O
)	O
followed	O
by	O
a	O
value	O
that	O
points	O
to	O
an	O
entry	O
in	O
a	O
lookup	B-Data_Structure
table	I-Data_Structure
(	O
or	O
dictionary	O
)	O
of	O
repeating	O
values	O
.	O
</s>
<s>
However	O
,	O
the	O
more	O
repeats	O
there	O
are	O
in	O
the	O
string	O
,	O
the	O
better	O
the	O
compression	B-General_Concept
will	O
be	O
.	O
</s>
