资源列表
Tasm_5
- TASM Compiler for free used.-processor used Compiler for free.
buffertest
- this ring buffer sample.
WindowsNetAndConmunicationDesign
- 讲述Windows网络程序设计的入门教程，展示了各种Windows I/O的方法，详细说明了高性能可伸缩性服务器的开发过程，并给出详细的实现代码。将编程方法、网络协议和应用实例有机组合起来，详细介绍了Internet广播和IP多播、原始套接字、SPI、LAN和WAN上的扫描和侦测技术、网络数据的窃取和保护、ARP欺骗、IP欺骗等。详细演示了协议驱动的开发过程，介绍了NDIS编程接口。在编程实践中学习P2P程序设计、讨论了穿透防火墙、NAT等直接建立UDP和TCP连接的各种方案。包含了Window
OffComputer
- 关闭计算机程序原代码，通过调用windows系统的API函数来关闭计算机。-closed computer program source code, called the Windows system through API functions to shut down the computer.
test_ipv6
- LINUX内核编程,可以截获网络上IPV6数据包文-Linux kernel programming, the network can be intercepted data packets text IPV6
WEPCrack-0.0.10.tar
- wlan的WEP密钥系统的解密,WEP为共享加密系统。更新的加密系统为WPA2，中国的WAPI很遗憾没有纳入标准。-wlan the WEP key of the decryption system, WEP encryption system for sharing. Updated to WPA2 encryption system, China's WAPI regret not included in the standard.
Example18
- 网络性能监控与流量统计系统，能实现大部分监测与统计-network performance monitoring and traffic statistics system can achieve most of the monitoring and statistics
Example05
- 因为本系统在写成电子稿件的时候，界面是英文的，因此在书中介绍代码的时候，都是采用英文界面名称，如“\"Encrypt\"按钮单击事件代码”，但是书上的界面后来被汉化，导致文本和图不一致，因此在此提供英文界面和中文界面两个版本的系统。-because of the system of electronic articles written in a time when the interface is in English, the book on the code, are English in
tcm_8psk
- The Viterbi algorithm is the same as the binary case with one main difference: The survivor sequences include the uncoded bits, which are decided at each trellis stage when selecting one of two parallel branches with the largest correlation metric.
golay24
- Encoding and decoding of the binary extended (24,12,8) Golay code: An arithmetic decoding algorithm. It is a very close relative of the error-trapping decoding algorithms developed by Kasami in the 1960s.-Encoding and decoding of the binary extend
rm13_awgn
- Simulation of RM(1,3), equivalent to the (8,4,4) extended Hamming code. Soft-decision decoding performed by the Green machine-Simulation of RM (1,3). equivalent to the (8,4, 4) extended Hamming code. Soft-decision decod ing performed by the Green m
rs_eedec_euc
- The Reed-Somolon code is specified by the finite field, the length (length <= 2^m-1), the number of redundant symbols (length-k), and the initial zero of the code, init_zero, such that the zeros are: init_zero, init_zero+1, ..., init_zero