基于可逆RS码的第Ⅱ类多进制混合ARQ及其性能分析

针对二进制第Ⅱ类混合自动请求重传差错控制系统流量偏低的问题,提出了基于Reed-Solomon(RS)码的多进制混合自动请求重传方案.该方案将信息经RS码编码后,采用多进制调制,信息部分与校验部分分开传输,码的可逆性使得仅由无误的校验部分便可恢复出信息,利于提高流量.数值结果表明,该方案在Rician衰落信道下的流量比传统的二进制方案有了明显提高,同时可靠性依然保持与二进制方案相同的水平.     

计算机网络防护的主要手段

简要分析了计算机网络防护的重要性 ,并指出了一些常用的防护方法     

最大距离分割码误比特率的精确计算

基于最大距离分割(MDS)码的码重分布，得到了不完全译码器中发生译码错误和译码失败的概率．根据译码错误和译码失败对MDS码误比特率的影响，推导出精确的误比特率公式．利用该公式可计算出不同长度的MDS码在加性白高斯噪声(AWGN)信道中的误比特率．仿真结果表明，该公式比传统的误比特率上限公式具有更高的精度．     

Locating Highly Connected Nodes in P2P Networks with Heterogeneous Structures

Peer-to-peer (P2P) networks aggregate enormous storage and processing resources while minimizing entry and scaling costs. Gnutella-like P2P networks are complex heterogeneous networks, in which the underlying overlay topology has a power-law node degree distribution. While scale-free networks have great robustness against random failures, they are vulnerable to deliberate attacks where highly connected nodes are eliminated. Since high degree nodes play an important role in maintaining the connectivity, this paper presents an algorithm based on random walks to locate high degree nodes in P2P networks. Simulations demonstrate that the algorithm performs well in various scenarios and that heterogeneous P2P networks are very sensitive to deliberate attacks.