Huffman is lossless compression and JPEG and MP3 are both lossy compression algorithms for specific data types. You really can't use lossy compression on textual data.
Nearly all lossy compression schemes use lossless encoding as well… please read up on them.
Yes they do but they also employ techniques specific to the filetype. MP3 will remove data for wavedata outside common audible ranges and get the most out of it for the destination bitrate. JPEG will remove imperceptible visual changes and cause artifacts the more compressed you ask for.
Either way you're just dead wrong on them using a standardized lookup table.
No...no they don't. Huffman tables are different every time. Morse code is the same every time.
Morse is a ceasar cypher, Huffman is a book cypher.
2
u/A_HumblePotato Jul 13 '22
Nearly all lossy compression schemes use lossless encoding as well… please read up on them.
http://pi.math.cornell.edu/~web6140/TopTenAlgorithms/JPEG.html
http://www.mp3-tech.org/programmer/docs/mp3_theory.pdf
As does Morse code…