Memoryless source of an alphabet

19 Views Asked by At

I am doing an exercise where I have to find an upper bound Shannon's entropy for a memoryless source of an alphabet with $A$ letters. I don't understand what memoryless source of an alphabet means. Does that mean that the probability $p_i$ are all equal to $1/A$? How should I think about this?

1

There are 1 best solutions below

0
On

The phrase "memoryless source" typically refers to the situation where you are drawing a long string of letters from the alphabet $A$, and each choice of letter is independent of all the others and each choice follows the same probability distribution. It does not mean that that distribution has to be uniform; it can be any probability distribution on $A$.