CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER Fp^m ＋ uFp^m

In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.     

卫星振动对星间光码分多址系统性能的影响

卫星振动是影响星间光CDMA通信系统性能的一个重要因素.考虑多用户干扰、背景光噪音、热噪音、接收机噪音和卫星振动,给出了基于PPM信号格式的星间二维光CDMA通信系统的系统模型.采用数值分析的方法,详细分析了卫星振动对该系统误码率性能的影响.结果表明,码速率、通信波长和卫星振动都会影响星间二维光CDMA通信系统的误码率性能.当卫星振动标准偏差σ≤4×10－7时,卫星振动对系统误码率性能的影响较小;当卫星振动标准偏差σ≥1.2×10－6,卫星振动对系统误码率性能的影响很大,得到的误码率难以满足系统的通信要求,需要采用卫星振动抑制或补偿等技术提高星间二维光CDMA通信系统的误码率性能.     

The analysis of the error statistics in a 5 × 40 Gbit/s fibre link with hybrid amplification

We quantify the error statistics and patterning effects in a 5 × 40 Gbit/s WDM RZ-OOK SMF/DCF fibre link using hybrid Raman/EDFA amplification. By extensive use of a numerical model, we determine how the error statistics change with the transmission distance. This knowledge is used as a basis for a constrained coding technique in order to improve the transmission error rate. We propose an adaptive constrained code for mitigation of the patterning effects and demonstrate that this approach can substantially reduce the bit error rate (BER) even for very large values of the channel BER (BER > 10^− 1). The proposed technique can be used in combination with forward error correction schemes (FEC) to extend the range of channel BERs that an FEC scheme is effective over.     

A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.