当前位置:首页 > 题库 > 正文内容

Let $$C$$ be an alphabet in which each character $$c$$ in $$C$$

Luz7个月前 (05-10)题库129
Let $$C$$ be an alphabet in which each character $$c$$ in $$C$$ has frequency $$c.freq$$. If the size of $$C$$ is $$n$$, the length of the optimal prefix code for any character $$c$$ is not greater than $$n-1$$. ~@[](2)

答案:TRUE
分享给朋友:

发表评论

访客

◎欢迎参与讨论,请在这里发表您的看法和观点。