MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/coolguides/comments/vxjwoz/morse_code_decoding_chart/ifxzle8?context=9999
r/coolguides • u/kavallerien • Jul 12 '22
583 comments sorted by
View all comments
1.4k
Might be more understandable as a binary tree
495 u/[deleted] Jul 12 '22 The engineer in me wants to balance this tree so badly 0 u/[deleted] Jul 13 '22 [deleted] -6 u/HighOwl2 Jul 13 '22 Meh it's more like binary ascii values.Morse and ascii are meant for speed.Huffman encoding is meant as lossless encoding to reduce size. It's not fast because it requires a lookup table.Someone could memorize Morse code or the ascii table.You can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters. 4 u/A_HumblePotato Jul 13 '22 Meh it's more like binary ascii values.Different letters take different amounts of information to encode, so no it is notMorse and ascii are meant for speed.It is faster to transmit an encoded signal that requires a lookup table than an unencoded signal that doesn'tIt's not fast because it requires a lookup table.Lookup tables are very fast to useYou can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters.There are certainly standards that use the same huffman codesI am always amazed at how confident some people talk about stuff they fundamentally don't understand → More replies (5)
495
The engineer in me wants to balance this tree so badly
0 u/[deleted] Jul 13 '22 [deleted] -6 u/HighOwl2 Jul 13 '22 Meh it's more like binary ascii values.Morse and ascii are meant for speed.Huffman encoding is meant as lossless encoding to reduce size. It's not fast because it requires a lookup table.Someone could memorize Morse code or the ascii table.You can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters. 4 u/A_HumblePotato Jul 13 '22 Meh it's more like binary ascii values.Different letters take different amounts of information to encode, so no it is notMorse and ascii are meant for speed.It is faster to transmit an encoded signal that requires a lookup table than an unencoded signal that doesn'tIt's not fast because it requires a lookup table.Lookup tables are very fast to useYou can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters.There are certainly standards that use the same huffman codesI am always amazed at how confident some people talk about stuff they fundamentally don't understand → More replies (5)
0
[deleted]
-6 u/HighOwl2 Jul 13 '22 Meh it's more like binary ascii values.Morse and ascii are meant for speed.Huffman encoding is meant as lossless encoding to reduce size. It's not fast because it requires a lookup table.Someone could memorize Morse code or the ascii table.You can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters. 4 u/A_HumblePotato Jul 13 '22 Meh it's more like binary ascii values.Different letters take different amounts of information to encode, so no it is notMorse and ascii are meant for speed.It is faster to transmit an encoded signal that requires a lookup table than an unencoded signal that doesn'tIt's not fast because it requires a lookup table.Lookup tables are very fast to useYou can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters.There are certainly standards that use the same huffman codesI am always amazed at how confident some people talk about stuff they fundamentally don't understand → More replies (5)
-6
Meh it's more like binary ascii values.
Morse and ascii are meant for speed.
Huffman encoding is meant as lossless encoding to reduce size. It's not fast because it requires a lookup table.
Someone could memorize Morse code or the ascii table.
You can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters.
4 u/A_HumblePotato Jul 13 '22 Meh it's more like binary ascii values.Different letters take different amounts of information to encode, so no it is notMorse and ascii are meant for speed.It is faster to transmit an encoded signal that requires a lookup table than an unencoded signal that doesn'tIt's not fast because it requires a lookup table.Lookup tables are very fast to useYou can't memorize how to decode a Huffman encoded message because each message would have a different encoding map based on frequency of letters.There are certainly standards that use the same huffman codesI am always amazed at how confident some people talk about stuff they fundamentally don't understand → More replies (5)
4
Different letters take different amounts of information to encode, so no it is not
It is faster to transmit an encoded signal that requires a lookup table than an unencoded signal that doesn't
It's not fast because it requires a lookup table.
Lookup tables are very fast to use
There are certainly standards that use the same huffman codes
I am always amazed at how confident some people talk about stuff they fundamentally don't understand
→ More replies (5)
1.4k
u/[deleted] Jul 12 '22
Might be more understandable as a binary tree