Malicious Code Modeling and Analysis in Weighted Scale-Free Networks

We study the detailed malicious code propagating process in scale-free networks with link weights that denotes traffic between two nodes. It is found that the propagating velocity reaches a peak rapidly then decays in a power-law form, which is different from the well-known result in unweighted network case. Simulation results show that the nodes with larger strength are preferential to be infected, but the hierarchical dynamics are not clearly found. The simulation results also show that larger dispersion of weight of networks leads to slower propagating, which indicates that malicious code propagates more quickly in unweighted scale-free networks than in weighted scale-free networks under the same condition. These results show that not only the topology of networks but also the link weights affect the malicious propagating process.

A Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem

A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library.

Study on cipher propertys of constant weight codes

Constant weight code is an important error-correcting control code in communications. Basic structure of constant weight codes for some arriving at Johnson bound, A（n, 2u, w）, is presented. Some correlative propertys of the codes, the solution of arriving at Johnson bound, and the results on the couple constant code and some constant weight codes are discussed. The conclusion is verified through four examples.

Linear Codes with Two Weights or Three Weights from Two Types of Quadratic forms

Let F_qbe afinite field with q=pmelements,where pis an odd prime and mis apositive integer.Here,let D_0={(x_1,x_2)∈F_q^2\{(0,0)}:Tr(x_1^(pk1+1)+x_2^(pk2+1))=c},where c∈F_q,Tr is the trace function fromFF_qtoFpand m/(m,k_1)is odd,m/(m,k_2)is even.Define ap-ary linear code C_D =c(a_1,a_2):(a_1,a_2)∈F_q^2},where c(a_1,a_2)=(Tr(a_1x_1+a_2x_2))_((x1,x2)∈D).At most three-weight distributions of two classes of linear codes are settled.

Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements

In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w 【n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.

A Note on m-Weights of Linear Codes

m-weight, as a new generalization of classical Hamming weight, was discussedin this paper. A condition for the existence of linear codes of certain m-weights was given; theSingleton bound, Plotkin bound and Sphere Parking bound of Hamming weight were correspondinglygeneralized to the m-weight.

Construction and Weight Distributions of Binary Linear Codes Based on Deep Holes

Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.

Hybrid weighted symbol-flipping decoding for nonbinary LDPC codes

A hybrid decoding algorithm is proposed for nonbinary low-density parity-check （LDPC） codes, which combines the weighted symbol-flipping （WSF） algorithm with the fast Fourier trans- form q-ary sum-product algorithm （FFT-QSPA）. The flipped position and value are determined by the symbol flipping metric and the received bit values in the first stage WSF algorithm. If the low- eomplexity WSF algorithm is failed, the second stage FFT-QSPA is activated as a switching strategy. Simulation results show that the proposed hybrid algorithm greatly reduces the computational complexity with the performance close to that of FFT-QSPA.

Theoretical Analysis of Bit-Error Probability for Convolutional Codes with Weight Enumerators

The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function)T[x,y] of convolutional codes.Next use computer simulation to compare upper bound on the bit error probability on an additive white Gaussian noise(AWGN) for maximum free distance(MFD) codes of previously found and optimum distance spectrum(ODS) codes with rate 1/4,overall constraint length are 5 and 7,respectively.Finally,a method of how to search for good convolutional codes is given.

Error Probability for Convolutional Codes with Weight Enumerating Function

The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function) T[x,y] of convolutional codes.Next use computer simulation to compare upper bound on the bit error probability on an additive white Gaussian noise (AWGN) for maximum free distance (MFD) codes of previously found and optimum distance spectrum (ODS) codes with rate 1/4,overall constraint length are 5 and 7,respectively. Finally,a method of how to search for good convolutional codes is given.

改进型Code-Matched交织器

Turbo码作为信道编码方案 ,可以获得较高的误比特率 (BER)性能 ,而交织器的设计是影响Turbo码性能的关键环节 .笔者在码的重量分析的基础上提出了一种改进型Code Matched交织器 ,它可以减少低重量码的数量 ,从而提高Turbo码的性能 .这种改进型Code Matched交织器可以适用于多种不同生成矩阵产生的Turbo码 ,而且不会影响Turbo码在中、高信噪比处的性能 ,同时 ,在Rayleigh信道下 。

GAUSS PERIODS AND CYCLIC CODES FROM CYCLOTOMIC SEQUENCES OF SMALL ORDERS

Let p =ef +1 be an odd prime with positive integers e and f. In this paper, we calculate the values of Gauss periods of order e =3, 4, 6 over a finite field GF(q), where q is a prime with q≠p. As applications, several cyclotomic sequences of order e =3, 4, 6 are employed to construct a number of classes of cyclic codes over GF(q) with prime length. Under certain conditions, the linear complexity and reciprocal minimal polynomials of cyclotomic sequences are calculated, and the lower bounds on the minimum distances of these cyclic codes are obtained.

Turbo Codes with Modified Code-matched Interleaver over A WGN and Rayleigh Fading Channel

A novel Code-Matched interleaver is proposed which decreases the number of the low weight codewords to improve the performance of the Turbo code. The modified design can adapt more kinds of Turbo codes determined by the generator matrix, while it doesn＇t decrease the bit error rate performance of Turbo codes at moderate to high signal to noise ratio. At the same time, in Rayleigh fading channel, the new Code-Matched interleaver can also debase the error floor.

Two Classes of Quaternary Codes from Z_4-valued Quadratic Forms

Let R=GR (4,m)be a Galois ring with Teichmuller set T_m and Tr_m be the trace function fromRto Z_4.In this paper,two classes of quaternary codes C_1 = {c(a,b):a ∈R,b ∈ T_(m/2)},where c(a,b)=(Tr_m(ax)+Tr_(m/2)(2 bx^(2 m/2 +1)))_(x∈T_m),and C_2= {c(a,b):a ∈ R,b ∈ T_m}, where c(a,b)=(Tr_m(ax+2 bx^(2 k+1)))_(x∈T_m),and m/gcd(m,k)is even,are investigated,respectively.The Lee weight distributions,Hamming weight distributions and complete weight distributions of the codes are completely given.

The Digital Fingerprinting Method for Static Images Based on Weighted Hamming Metric and on Weighted Container Model

The algorithm of fingerprint constructing for still images based on weighted image structure model is proposed. The error correcting codes that are perfect in weighted Hamming metric are used as a base for fingerprint constructing.

Linear Codes over the Finite Ring <i>Z</i>₁₅

In this paper, the structure of the non-chain ring Z15 is studied. The ideals of the ring Z15 are obtained through its non-units and the Lee weights of elements in Z15 are presented. On this basis, by the Chinese Remainder Theorem, we construct a unique expression of an element in Z15. Further, the Gray mapping from Zn15 to Z2n15 is defined and it’s shown to be distance preserved. The relationship between the minimum Lee weight and the minimum Hamming weight of the linear code over the ring Z15 is also obtained and we prove that the Gray map of the linear code over the ring Z15 is also linear.

面向电力设备红外图像的混合噪声去除方法研究

电力设备的红外图像在采集传输过程中,易受高斯噪声与脉冲噪声的影响从而破坏图像的真实信息,为满足图像处理过程对图像质量的要求,文中提出了一种针对红外图像混合噪声的滤除方法。首先利用三方加权稀疏编码(TWSC)模型有效滤除红外图像中的高斯噪声,然后利用图像结构纹理分解结合中值滤波算法实现剩余脉冲噪声的分离与去除,实现在滤除红外图像混合噪声的同时较好地保持图像的边缘结构信息,结合实例分析表明文中方法能够有效滤除噪声并获得较高的峰值信噪比(PSNR)与结构相似度(SSIM)。

基于码重奇偶性的扩展BCH码盲识别

实际应用中的扩展BCH(Bose Chaudhuri Hocquenghem)码具有码率高、码长多变、结构复合等特点,在编码识别领域,对高码率编码码长估计、特定码型识别等方面仍缺乏研究成果。针对上述问题,提出了一种基于码重奇偶性的码长估计方法,在此基础上,利用有限域傅氏变换识别编码码型,实现了扩展BCH码的识别。该识别过程有别于其他文献中已知码型、再识别其他参数的方法,更加符合实际情况。仿真结果表明,所提方法能够实现二进制对称信道下的高码率扩展BCH码的识别。当误码率小于1.5×10^(-2)时,除了码长为128的编码,对其他码长的编码识别准确率能达到94%以上,当误码率小于7×10^(-3)时,识别准确率接近100%,识别性能优于现有算法。所提方法能有效实现对扩展BCH码的识别,具有较好的误码适应能力。

一种基于视觉显著性的码率控制算法

针对当前高效视频编码的码率控制算法未能充分确保视频显著区域的图像质量问题,提出了一种基于视觉显著性的码率控制算法。首先,采用基于图的流形排序显著检测算法获取视频的显著区域;其次,在图像编码过程中,为每个编码单元(Coding Unit,CU)建立基于视觉显著性的加权失真公式,将显著性值作为权重;最后,通过求解得到拉格朗日乘子λ,并根据原始码率控制算法中的λ与量化参数(Quantization Parameter,QP)的关系为每个CU确定QP。试验结果表明,该算法有效地根据视频内容的显著性权重实现了码率的合理分配,并在保持码率控制准确性的同时,提升了视频显著区域的图像质量。

一类基于Weil和的少重量二元线性码

近年来,通过定义集构造有限域上少重量线性码得到了广泛的关注。部分少重量线性码已经被应用于密钥分享方案,强正则图、认证码和关联方案。本文中研究一类线性码的参数和重量分布,得到二重或四重的二元线性码,并确定它们对偶码的参数。特别地,部分对偶码是关于Sphere packing界距离最优的。