Not yet a member? No problem!
Sign-up just takes a second.
Forgot your password?
Recover it now.
Already signed up?
Log in now.
Forgot your password?
Recover it now.
Not yet a member? No problem!
Sign-up just takes a second.
Remember your password?
Log in now.
10 Comments
siftbotsays...Moving this video to oritteropo's personal queue. It failed to receive enough votes to get sifted up to the front page within 2 days.
Deanosays...Very interesting. Shall promote when I have a point.
Deanosays...*promote
siftbotsays...Promoting this video and sending it back into the queue for one more try; last queued - promote requested by Deano.
ChaosEnginesays...To further illustrate the complexity involved in compression, think about the following:
If I replace "The computerphile channel handles computer topics" with "The computerphile channel handles <30,8> topics", how does the decoder tell the difference between the 2 byte <30,8> pointer and the data it represents?
antsays...*geek
siftbotsays...Adding video to channels (Geek) - requested by ant.
worthwordssays...compression is fascinating. i used to work for a mobile phone OS company where i modified the language variant compiler to compress files based on a premade dictionary of words which were common over the whole software - it cut down the ROM size by many megabytes (which was a big deal back then). You could cut the amount of traffic on the internet by having a dictonary of common cats stored in the image decoder.
teebeenzsays...Huffman is my fav example, with PPM my second. PPM being the king these days.
oritteroposays...Somewhat related to PPM, I also quite liked Ian Phillipps' entry in the 1988 IOCCC:
http://www.ioccc.org/years.html#1988_phillipps
Huffman is my fav example, with PPM my second. PPM being the king these days.
Discuss...
Enable JavaScript to submit a comment.