A cyclic code with minimum redundancy used to check errors in a set of characters.
一种用于检查一组字符的错误、并且具有最小冗余度的循环码。
In this paper it has been proved by the optimal tree construction of graph theory that Huffman's code is an optimal method of coding with minimum redundancy.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
应用推荐