ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Notices
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Get a virtual cloud desktop with the Linux distro that you want in less than five minutes with Shells! With over 10 pre-installed distros to choose from, the worry-free installation life is here! Whether you are a digital nomad or just looking for flexibility, Shells can put your Linux machine on the device that you want to use.
Exclusive for LQ members, get up to 45% off per month. Click here for more info.
Have you tried UHARC? It squezed 2 GB into a 300mb file... the compression/decompression indeed is very slow, but hey, you save a lot of space For more info take a look at this site http://www.maximumcompression.com/programs.php
Originally posted by JanusPaul The compression in a dailup modem DOES EXIST! And it's not going to be found in a 'driver' file. It's HARD BUILT into the hardware itself. When one modem sends data over the wire to another modem, one divides the data by the polynomial expression, sends the remainder, the receiving end applies the remainder back into the expression. There ya go, a perfect 4:1 lossless compression for any case! Awesome/Brilliant as it may seem, it's possible!
If you're talking 4:1 lossless reduction, the trick is probably within the modulation of the signal on the line
(that is, take 4 or 8 or 16 states of the signal instead of only 2 - number of states limited by line quality).
I don't think that a software algorithm can losslessly compress 4:1 (except for special cases), since usually
there isn't that much redundancy in typical data.
Originally posted by Marius2 If you're talking 4:1 lossless reduction, the trick is probably within the modulation of the signal on the line
(that is, take 4 or 8 or 16 states of the signal instead of only 2 - number of states limited by line quality).
I don't think that a software algorithm can losslessly compress 4:1 (except for special cases), since usually
there isn't that much redundancy in typical data.
Distribution: Solaris 11.4, Oracle Linux, Mint, Debian/WSL
Posts: 9,789
Rep:
Quote:
4-bits = 16 states, a way to level out the data.
and 1 bit = 2 states, that's the basics, nothing is leveling out or off here ...
These hardware algorithms are not compressing the data, but just improving their use of an analogical transport medium.
It's just like claiming a text written with a smaller font is a compressed version of the same one with a larger font ...
Nothing is related with data compression here.
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.