For Programmers: Free Programming Magazines  


Home > Archive > Compression > April 2006 > Re: Please, PLEASE, hold your questions/comments/elsewhat til the end. Thank you. :)









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author Re: Please, PLEASE, hold your questions/comments/elsewhat til the end. Thank you. :)
jacko

2006-04-17, 7:55 am

the proof that n bits can never represent 2^n combinations relies on
the observation that there are only 2^n bit patterns in n bits. fair
enough. BUT. n bits can generate a non repeating sequence upto 2^(n-1)
bits long, with emphisis on UPTO.

xxxx -> yyyy mapping is involved in turning 4 bits into 4 other bits.
this is a direct mapping, and no bit saving will occur on average with
any direct mapping of information.

but if

xxxx -> yyyy if 0 is to be absorbed
xxxx -> zzzz if 1 is to be absorbed

then so long as it is know which bit state was absorbed it is possible
to uniquely map back from either yyyy or zzzz to xxxx

OK so far??

Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2008 codecomments.com