 | | From: | code_wrong | | Subject: | How can I represent 3 base 256 numbers in less bytes? | | Date: | Thu, 20 Jan 2005 13:34:03 -0000 |
|
|
 | Hi,
How can I represent 3 base 256 numbers in less bytes?
the numbers might be
9 234 120 26 99 200
80 54 211 18 60 120
45 77 123 123 123 0
In this example the numbers require 6 bytes each
I have considered storing a base number in a lookup table and thereby only
needing to store the offsets of the 3 numbers .. but I find that these are
just as big unless I get lucky.
I have also considered the three numbers as the three sides of a triangle
allowing me to store only one of the three numbers and 2 angles .. thereby
allowing me to calculate the other 2 numbers but I fear the angles will need
to be so precise that they will require as many bytes to store .. I have not
yet calculated this .. I figured I would throw the idea out here .. as the
experts will know straight away if it will facilitate compression
regards
cw
|
|
| | From: | Willem | | Subject: | Re: How can I represent 3 base 256 numbers in less bytes? | | Date: | Thu, 20 Jan 2005 16:45:09 +0000 (UTC) |
|
|
| code_wrong wrote:
) Hi,
) How can I represent 3 base 256 numbers in less bytes?
You can't, unless you have extra information on thuse numbers.
SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
|
|
| | From: | David A. Scott | | Subject: | Re: How can I represent 3 base 256 numbers in less bytes? | | Date: | 20 Jan 2005 14:04:37 GMT |
|
|
| "code_wrong" wrote in
news:1106227987.26689.0@ersa.uk.clara.net:
> Hi,
> How can I represent 3 base 256 numbers in less bytes?
>
> the numbers might be
>
> 9 234 120 26 99 200
> 80 54 211 18 60 120
> 45 77 123 123 123 0
>
Not sure what your doing they don't
look like base 3 numbers. But if each
number an integer from 0 to 255 one BYTE
is all you need for each number.
David A. Scott
--
My Crypto code
http://bijective.dogma.net/crypto/scott19u.zip
http://www.jim.com/jamesd/Kong/scott19u.zip old version
My Compression code http://bijective.dogma.net/
**TO EMAIL ME drop the roman "five" **
Disclaimer:I am in no way responsible for any of the statements
made in the above text. For all I know I might be drugged.
As a famous person once said "any cryptograhic
system is only as strong as its weakest link"
|
|
| | From: | Popai | | Subject: | Re: How can I represent 3 base 256 numbers in less bytes? | | Date: | 21 Jan 2005 04:46:16 -0800 |
|
|
| Compute base 3 any number between 0 ... 255 using ceil of log3(256)
trigits (0,1,2) eventualy pading with zero.
Rewrite 0 -> 0
1-> 10
2-> 11
Or any combination (the idea is to asing "0" to the most frequent
trigit from your message)
|
|
