It is an experimental testing for python M2Crypto module. M2Crypto is not well document. User may not know how to use SHA256 when signing and verify with RSA. It also have not enough document to show how to use DES to encrypt and decrypt. Here also includes source Codes for performance evaluation of the algorithms. This experimental program explore all this issue and may be helpful for some one who using python for doing encryption with RSA and DES.
標(biāo)簽： M2Crypto experimental document testing
上傳時(shí)間： 2016-08-08
上傳用戶：上善若水
1993 年兩位法國(guó)教授Berrou、Glavieux 和他們的緬甸籍博士生Thitimajshima 在ICC 會(huì)議上發(fā)表的Near Shannon limit error-correcting coding and decoding: Turbo Codes”，
標(biāo)簽： error-correcting Thitimajshima Glavieux Shannon
上傳時(shí)間： 2016-12-06
上傳用戶：Avoid98
This package provides encoders and fast Viterbi decoders for the NASA standard rate 1/2 and rate 1/3 constraint length 7 convolutional Codes.
標(biāo)簽： rate and encoders decoders
上傳時(shí)間： 2013-12-18
上傳用戶：彭玖華
44b0公版的測(cè)試程序， ******************************************************* * NAME : 44BINIT.S * * Version : 10.JAn.2003 * * Description: * * C start up Codes * * Configure memory, Initialize ISR ,stacks * * Initialize C-variables * * Fill zeros into zero-initialized C-variables *
上傳時(shí)間： 2013-12-22
上傳用戶：teddysha
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (Codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of Codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
3D FDTD 計(jì)算程序 ToyFDTD1 is a stripped-down, minimalist, 3-dimensional FDTD code that is published under the GNU General Public License. It is the first in the ToyFDTD series of Codes, and it illustrates in heavily commented C and Fortran the basic tasks in implementing a simple 3D FDTD simulation.
標(biāo)簽： FDTD stripped-down dimensional minimalist
上傳時(shí)間： 2013-12-25
上傳用戶：fhzm5658
Create a Delaunay triangulation or Voronoi diagram by clicking points. Delaunay triangulations and Voronoi diagrams are among the most widely used data structures in the field of Computational Geometry. These are Java-oriented source Codes.
標(biāo)簽： Delaunay triangulations triangulation clicking
上傳時(shí)間： 2013-11-25
上傳用戶：zhaiye
This thesis is devoted to several efficient VLSI architecture design issues in errorcorrecting coding, including finite field arithmetic, (Generalized) Low-Density Parity- Check (LDPC) Codes, and Reed-Solomon Codes.
標(biāo)簽： errorcorrecting architecture efficient devoted
上傳時(shí)間： 2017-05-08
上傳用戶：康郎
This is program with source code to convert ascii text files to the maxicode barcode standard. The input file consists of two columns. The first column represents a code and the second column is a string enclosed in quotes. The Codes for the first column are as follows: PM, SM, CC, MO, SC, and PC.
標(biāo)簽： maxicode standard barcode convert
上傳時(shí)間： 2017-06-07
上傳用戶：ardager
An application on Hotel Management System. I developed it for my project during exam time. Any how it rewarded as best project. my other source Codes are at: http://www.developerssourcecode.com Thanks Shyam Singh Chandel
標(biāo)簽： application Management developed project
上傳時(shí)間： 2014-01-20
上傳用戶：alan-ee
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
