<s>
A	O
comma	B-General_Concept
code	I-General_Concept
is	O
a	O
type	O
of	O
prefix-free	B-Algorithm
code	I-Algorithm
in	O
which	O
a	O
comma	O
,	O
a	O
particular	O
symbol	O
or	O
sequence	O
of	O
symbols	O
,	O
occurs	O
at	O
the	O
end	O
of	O
a	O
code	O
word	O
and	O
never	O
occurs	O
otherwise	O
.	O
</s>
<s>
For	O
example	O
,	O
Fibonacci	B-Algorithm
coding	I-Algorithm
is	O
a	O
comma	B-General_Concept
code	I-General_Concept
in	O
which	O
the	O
comma	O
is	O
11	O
.	O
</s>
<s>
11	O
and	O
1011	O
are	O
valid	O
Fibonacci	B-Algorithm
code	I-Algorithm
words	O
,	O
but	O
101	O
,	O
0111	O
,	O
and	O
11011	O
are	O
not	O
.	O
</s>
<s>
Unary	B-Algorithm
coding	I-Algorithm
,	O
in	O
which	O
the	O
comma	O
is	O
0	O
.	O
</s>
<s>
Fibonacci	B-Algorithm
coding	I-Algorithm
,	O
in	O
which	O
the	O
comma	O
is	O
11	O
.	O
</s>
<s>
All	O
Huffman	B-General_Concept
codes	I-General_Concept
can	O
be	O
converted	O
to	O
comma	B-General_Concept
codes	I-General_Concept
by	O
prepending	O
a	O
1	O
to	O
the	O
entire	O
code	O
and	O
using	O
a	O
single	O
0	O
as	O
a	O
code	O
and	O
the	O
comma	O
.	O
</s>
<s>
Such	O
data	O
can	O
be	O
termed	O
'	O
generic	O
data	O
 '	O
can	O
be	O
analysed	O
using	O
any	O
interleaving	O
unary	B-Algorithm
code	I-Algorithm
as	O
headers	O
where	O
additional	O
bijective	O
bits	O
(	O
equal	O
to	O
the	O
length	O
of	O
the	O
unary	B-Algorithm
code	I-Algorithm
just	O
read	O
)	O
are	O
read	O
as	O
data	O
while	O
the	O
unary	B-Algorithm
code	I-Algorithm
serves	O
as	O
an	O
introduction	O
or	O
header	O
for	O
the	O
data	O
.	O
</s>
<s>
This	O
is	O
quite	O
visible	O
from	O
an	O
implied	O
probability	O
of	O
50%	O
for	O
the	O
0	O
code	O
in	O
Huffman	O
base	O
3	O
codes	O
:	O
0	O
,	O
10	O
,	O
11	O
(	O
net	O
2/3	O
or	O
66.66	O
%	O
commas	O
)	O
or	O
the	O
base-5	O
comma	B-General_Concept
code	I-General_Concept
shown	O
above	O
.	O
</s>
<s>
It	O
can	O
be	O
somewhat	O
expensive	O
to	O
convert	O
a	O
known	O
binary	O
value	O
to	O
ternary	O
unless	O
ternary	O
bit	O
costs	O
are	O
reduced	O
to	O
similar	O
to	O
binary	O
bit	O
costs	O
,	O
so	O
this	O
bit	O
can	O
be	O
multiplexed	O
in	O
a	O
separate	O
binary	O
channel	O
if	O
costs	O
agree	O
(	O
this	O
may	O
require	O
a	O
read	O
of	O
an	O
additional	O
'	O
tail'/trailing	O
portion	O
of	O
2-bits	O
pure	O
data	O
for	O
the	O
binary	O
channel	O
(	O
from	O
after	O
the	O
first	O
bit	O
of	O
the	O
first	O
change	O
as	O
this	O
is	O
not	O
an	O
instantly-decodable	O
code	O
,	O
simply	O
read	O
if	O
using	O
an	O
instantly	O
decodable	O
unary	B-Algorithm
code	I-Algorithm
)	O
to	O
be	O
similar	O
to	O
the	O
2	O
average	O
ternary	O
bits	O
remaining	O
on	O
the	O
primary	O
channel	O
equivalent	O
to	O
bits	O
before	O
cost	O
comparisons	O
are	O
factored	O
in	O
)	O
.	O
</s>
<s>
Cardinal	O
numbers	O
for	O
efficient	O
base	O
conversion	O
-	O
Since	O
it	O
has	O
been	O
ascertained	O
that	O
comma	B-General_Concept
codes	I-General_Concept
are	O
very	O
similar	O
to	O
base	O
conversion	O
,	O
the	O
only	O
concern	O
being	O
efficiency	O
and	O
timing	O
,	O
the	O
direct	O
conversion/mapping	O
of	O
19	O
binary	O
bits	O
numbers	O
to	O
12	O
ternary	O
trits	O
numbers	O
allow	O
for	O
an	O
efficiency	O
of	O
or	O
efficiency	O
depending	O
upon	O
the	O
method	O
of	O
calculation	O
.	O
</s>
