21.3. Ambiguity in Morse Code

So, in the Morse code encoding, different letters do have different encodings and in English e is the most frequent letter and t is another variant frequent letter. So, Morse assigned them codes of a dot, that is 0 for e and a dash, that is 1 for t, then a Morse took other frequent letters, such as a and gave them two letter encodings. So, a is encoded as dot dash, where 0 and 1.

Morse code is a system of encoding letters into sequences of dots and dashes. Each letter is represented by a unique sequence, allowing for effective communication. For instance, the letter 'e' is represented by a single dot (0), while 't' is represented by a single dash (1). Other letters, like 'a', have longer encodings, such as dot dash (01). This system helps to differentiate more frequently used letters from those that are less common.

Think of Morse code as a short-hand for letters. Just like how texting shorthand uses symbols and abbreviations to save time (like 'u' for 'you'), Morse code assigns simple sounds for common letters to make them quicker to transmit.

Now, the problem with Morse’s encoding is that it is ambiguous, when you come to decoding. So, for instance, if we look at the word, the sequence 0 1, then we do not know whether we should interpret each of these as a one letter code and get e t e t, all for instance we should think of this as 2 two letter of codes and get a a and so on.

The ambiguity arises in Morse code because the same sequence can represent multiple interpretations. For example, the sequence '0 1' could be decoded as either 'e t' (one single-letter code each) or 'a a' (two-letter codes). Without clear markers, it becomes difficult to determine how many letters are represented, leading to confusion in understanding the message.

Imagine you're reading a text with unclear punctuation. A sentence like 'Let's eat, Grandma!' versus 'Let's eat Grandma!' has dramatically different meanings. Similarly, lacking the right pauses or indicators in Morse code can result in misinterpretation.

So, in order to make a variable length code an unambiguous decodable, we need what is called a prefix quantity. When we read through a sequence of 0’s and 1’s, we should be an ambiguously clear, whether we have read a letter or there is more to read.

To avoid ambiguity in decoding, Morse code—and variable-length codes in general—requires a prefix condition. This means that no code can be the beginning (or prefix) of another code. In practice, it allows decoders to know with certainty where one letter ends and the next one begins as they read through a string of coded characters.

Consider a book where every chapter starts with a unique symbol. If you see a symbol, you immediately know that it marks the beginning of a new chapter and that you can clearly understand when one ends and the next begins. This is similar to having a prefix condition in coding.

So, our goal is to find optimal prefix codes. So, we need to talk about what we mean by optimality. So, remember we said that our goal is to assign shorter codes to more frequent letters. So, somehow we have to determine what are more frequent and less frequent letters?

The concept of optimal encoding focuses on assigning shorter codes to letters that appear more frequently in a message. To achieve this, frequency analysis of letters in the written language is essential. By assessing how often each letter appears, we can construct a coding scheme that enhances efficiency in data transmission, thereby minimizing the average number of bits required for sending messages.

Think about a vending machine stocked with popular snacks on the top shelves—these are the ones that people buy most often. Similarly, a good encoding system would place the most frequently used letters at the front, using shorter codes for them, just like making sure popular snacks are easy to grab.

So, this tells me how many bits I need to encode that particular letter, add up all the letters, I get the total length of the encoded message. And if I do not include this n, it is no to said n it is not a part of the summation, it is an independent thing, it is a fraction of any n.

Calculating the expected length of encoding involves summing the products of frequency and the length of each encoding for all letters. This gives insight into how efficient the encoding is and enables us to determine the average number of bits needed per letter when sending the entire message. Understanding this helps in evaluating the efficiency of a coding scheme.

Imagine packing a suitcase. If you fit heavier items at the top and lighter items at the bottom, it takes less effort to pack. Similarly, optimizing where you place letters based on their frequency makes encoding more efficient, saving not just space but also processing time.

--