I'm trying to understand the Huffman compression algorithm.Lets assume the word : YESSSSAccording to Huffman tree we will get :S : 4 times -> Code : 0Y : once    -> Code : 01E : once    -> Code : 00at the end YESSSS will become : 01 00 0 0 0 0So far everything is clear.Now my problem is in the space between the binary words. How this can be stored in memory ?In another words ?How to computer will know that that :the first character has two bitsthe second character has two bitsthe fourth other characters has only one bitBecause 01 00 0 0 0 0 doesn't have the same meaning than 01 00 00 0001 00 0 0 0 0 means : YESSSS01 00 00 00 means : YEEEAny ideas please ?
How to determine letter boundaries in Huffman encoded strings?
coding theory