Unary Representation
- From: Fibonacci Code <anglikai@xxxxxxxxx>
- Date: Tue, 19 Feb 2008 04:55:21 -0800 (PST)
Hi All,
Is there anyway to represent a binary string to unary
representation, with the samesize as the orignal string ?
FYI, unary coding
1 0
2 10
3 110
4 1110
5 11110
......
If I had a binary string of 111100001010011
Unary representation is 111011100001010
But if I had binary string of 000011110101100 (Inverse of
111100001010011)
Unary representation is 111011100001010
Hence both of the string 111100001010011 and 000011110101100 were
map to 111011100001010
then I will need extra one bit to say if it start with 1 or start with
0.
that will be one bit extra from the original string.
Is there any other way to represent a binary string to unary
representation yet maintain the size ?
Please advise.
Many thanks.
Ray
.
- Follow-Ups:
- Re: Unary Representation
- From: biject
- Re: Unary Representation
- Prev by Date: Re: Finding H.264 specification
- Next by Date: Re: Best existing binary compressor method?
- Previous by thread: Finding H.264 specification
- Next by thread: Re: Unary Representation
- Index(es):
Relevant Pages
|
|