Re: let C be a Prefix Code d1...dn length of each word

avtomatkalashnikov@xxxxxxx wrote:
) but if you meant 2^ci, where ci are constants, the problem is a bit
) more difficult to solve. are these values constants? can they be
) expressed by an equation? or ar they just in N: ci = 1, 2, 3, ... (note
) that the the values don`t need to be ordered, eg: ci = 100, 33456, 1,
) 56, ... etc) can something like ci = cj where i <> j happen? i`m not a
) mathematican, but i like so solve such problems on my own :)

If you read the subject, you'll notice he's talking about
a prefix-free code, where d1..dn are the lengths of the words.

This is comp-dot-ression after all.


SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
.

Relevant Pages