Compressing A byte

I will prove theoretically how it possible:
Every byte N contains 8 bits, due format.
However the space of a byte is not optimally used.
This a table of how much space is used by certain bytes:
Byte Value:       Size
128-155       8bits
64-127       7bits
32-63       6bits
16-31   5 bits
8-15  4bits
4-7  3 bits
2-3  2 bits
0-1 1 bit
Notice a pattern? The lower the byte value, the less data it contains!
Aggregation of such truncated bytes would take less bits than initial byte.
a value of 31 will take only 5 bits in a bitstring.

The jews are after my children.

http://en.wikipedia.org/wiki/Pigeonhole_principle

And assuming you're not trolling, which is becoming increasingly hard to do:

What does 1010 decompress to?
1, 0, 1, 0?
2, 2?
10?

1010 as 4-bit bitstring is 10, and it will occupy only 4 bits at ideal compression level, not 8.

>>4
Then how do you encode 2, 2?

>>5
I am working on a simple C algorithm to provide fixed-length bitarray compression, there will be a depacking scheme to extract from locations inside bytes.

He's officially trolling. You can't be this dense.

Let's do this the hard way, >>1: Write up a code example that decompresses a string of bits to the following bytes:

5, 45, 145, 32, 64, 0, 1

By your logic, this string contains 32 bits. You may not ``read'' any other data except these bits.

>2011
>Replying to frozen void
Who am I quoting?

if anyone takes this thread seriously - leave /prog/ NOW

>>8
back to /jp/

>>10
suck my cock dude