Please don't put meaningful content in the subject line.
) Subject: Re: let C be a Prefix Code d1...dn length of each word
) I need to show that
Isn't that the Kraft Inequality ?
I assume you mean prefix-free code, by the way.
) Tried to do it in induction but it didn't work. Is that the way to do
I'm no expert on it, but one possibility would be to
assume that it's >1 and then try to derive a contradiction.
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 !