搜索资源列表
1
- RS译码的Euclid算法及其FPGA实现
midify_euclid
- 修正的euclid算法matlab程序，验证通过
EUCLID
- 欧几里德算法：非常实用的！经调试通过！源代码不需任何修改！
bch_matrix_v1_0_tar
- The package contains a Reed-Solomon coding and decoding program, derived partly from Phil Karn/Robert Morelos-Zaragoza \"new_rs_erasures.c\". In particular the Berlekamp-Massey algorithm has not been modified. New features compared to \"new_r
RS_Euclid_FPGA
- RS译码的Euclid算法及其FPGA实现，并通过仿真器的出结果，对于设计ＲＳ译码很有帮助
TestRsa
- 个人编的rsa的源代码，算出public—private key；其中有Euclid，Extend Euclid的实现，以及Millar-Rabin test的实现，和加密/解密
qu
- 就是两个多项式的欧几里得算法，即求两个多项式的最大公约数。-two polynomial is the Euclid algorithm, namely polynomial for the two majors.
Euclid
- c语言 欧几里得除法-Euclidean division of c language
acm
- acm中各种代码，除此参与acm有欧几里得，拓展欧几里得，求素数等问题-acm various code involved in addition there acm Euclid, Euclid expansion, and issues such as prime numbers
200707171152015173
- 图像检索中颜色的特征提取及匹配算法，以家权欧几里得距离，中心距得加权距离，直方图交集算法等。-Image Retrieval color feature extraction and matching algorithm to the right home Euclid distance, center distance of a weighted distance, histogram intersection algorithm.
Euclidium
- 歐基理德輾轉相除法(之一) 以歐基理德輾轉相除法求出m，n這2個整數的最大公因數 -Reed Euclid division algorithm (one) to Euclid division algorithm Reed obtained m, n this two integers gcd
fasterEuclidium
- 歐基理德輾轉相除法(之二) m與n相差太大時，可用(m％n)來取代(m-n)，這樣的處理效率較高。以下便以此方法求出最大公因數。 -Reed Euclid division algorithm (II) m and n be too significant, the available (m％ n) to replace the (mn), this kind of treatment more efficient. The following will be obtained in t
ojld
- 可以输出最大公约数 用Java语言实现扩展欧几里得算法 -Common denominator can be output using Java language extended Euclid algorithm
EuclideanalgorithmfGCD
- In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not
euclid[1]
- 实现了eculid算法，是一个很好的算法，实用于RSA-Achieved eculid algorithm, the algorithm is a good, practical in the RSA
rsa
- 算法不是很难，不过当初在写扩展欧几里得的时候还是不是处理得很好，现在改了下传上来，写得不好欢迎大家指点-Algorithm is not difficult, but was extended in Euclid' s time to write or not to deal with very well, and now up to the next mass, not well written advice welcome
POJ2115
- ACM POJ 2115 扩展欧几里得算法解题报告-ACM POJ 2115 Euclid algorithm for solving the report of the expansion
colorguide
- 简单的图形处理程序，供大家分享。程序运行后，首先从图中截取一块区域，然后程序会对这个区域计算像素均值和欧几里得差值，并得到结果。 -Simple graphical procedure for everyone to share. Program runs, the first interception of a regional map, and then the procedure will be calculated in the region and the pixel averag
jisuanjihedaolun
- 大量领域应用了计算几何的问题,包括欧几里得巡回售货员问题,最小生成树问题,隐藏线问题和线性规划问题-A large number of field applications of computational geometry problems, including Euclid roving salesman problem, minimum spanning tree problem, hidden line problem and linear programming problems, a
euclid
- extended euclidean algorithm for polynomials with maple