一种用于检查一组字符的错误、并且具有最小冗余度的循环码。
A cyclic code with minimum redundancy used to check errors in a set of characters.
以国际标准CRC-CCITT循环冗余校验码为研究对象，利用近世代数多项式理论证明其奇偶校验性质、最小码距和纠正单比特错误能力。
The polarities check ability, minimum code distance and capacity of correct single bit error of CRC-CCITT are proved by using galois field polynomial theory.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
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.
应用推荐