单选题:There are n(=8) characters which frequencies are the first n(=8)
There are $$n$$(=8) characters whose frequencies are the first $$n$$(=8) Fibonacci numbers. How many of the following statements about the Huffman Coding is/are correct?
(1) No more than 2 characters have the same code length.
(2) For any $$n$$ ($$n>2$$), the maximum length of the codes is $$n-1$$.
(3) The minimum length of codes is 2.
A.0
B.1
C.2
D.3
答案:C
(1) No more than 2 characters have the same code length.
(2) For any $$n$$ ($$n>2$$), the maximum length of the codes is $$n-1$$.
(3) The minimum length of codes is 2.
A.0
B.1
C.2
D.3
答案:C