对数据通信中的差错控制编码技术——循环冗余码和海明码进行了详细的讨论和研究，并加以实际应用。
A coding technology of error control on data traffic——cyclic redundancy code and Hamming code——isdiscussed and investigated.
在计算机网络通信中，为了降低数据通信线路传输的误码率，可以采用一种差错检测控制———循环冗余码校验(CRC)。
In this paper, it studies one of the error-check controls of the communications of computers network-Cyclic Redundancy check (CRC).
为了提高单片机之间的通信速度，设计了一种循环冗余码校验CRC (Cyclic RedundancyCheck)算法。
In order to improve the communication of single-chip microcomputers, we designed an algorithm of CRC (Cyclic Redundancy Check).
在一些实施例中，存储器装置包括用于提供读数据位的存储器阵列和用于生成与读数据位对应的CRC位的循环冗余码(CRC)生成器。
In some embodiments, a memory device includes a memory array to provide read data bits and a cyclic redundancy code (CRC) generator to generate CRC bits corresponding to the read data bits.
一种用于检查一组字符的错误、并且具有最小冗余度的循环码。
A cyclic code with minimum redundancy used to check errors in a set of characters.
论文从字节码的角度描述了不同的混淆方法，并设计了有效的方法来产生冗余代码。
We described all kinds of obfuscating methods as viewed from byte code and designed effective method to produce redundant code.
然后基于内涵缩减，我们给出了从格上提取关联规则的算法伪码，两个性质被用来去除冗余的关联规则；
Then we give out the algorithms for extracting association rules from the lattice based on intent reduct, where two properties are exploited to remove the redundant rules.
本文提出了基于字节查表生成循环冗余校验码（CRC码）的三种软件算法，并对其效率进行了分析。
This paper puts forward three table-based software algorithms to create cyclic redundancy check(CRC) code, and analyses efficiency of the algorithms.
以国际标准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 addition, the redundancy mechanism by double-sending the embedded database data and the system test data enhanced the system reliability.
利用RS码的编码冗余和图像特定域的数据特性实现了基于RS码的图像半脆弱水印。
The proposed semi-fragile watermarking scheme is realized using the RS error-correcting codes and wavelet decomposition.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
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.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
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.
应用推荐