Consider an alphabet of a discrete memoryless source having eight source symbols with their respective probabilities as given below: [sk] = [s0 s1 s2 s3 s4 s5 s6 s7] [pk] = [0.48 0.15 0.10 0.10 0.07 0.05 0.03 0.02 ] (a) Determine the entropy of the specified discrete memory less source. (b) If the simple binary encoding is used, what is the maximum and average length of the code words? (c) Determine the efficiency of simple binary encoding technique used. (d) Determine the redundancy of simple binary encoding technique used for related theory. In binary encoding, the maximum and average length of the code words for 8 source symbols will be = 3 bits each (23 = 8).
Consider an alphabet of a discrete memoryless source having eight source symbols with their…
Consider an alphabet of a discrete memoryless source having eight source symbols with their respective probabilities as given below: [sk] = [s0 s1 s2 s3 s4 s5 s6 s7] [pk] = [0.48...
