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.     

Inhomogeneous Quantum Codes （III）： The Asymmetric Case

The stabilizer （additive） method and non-additive method for constructing asymmetric quantum codes have been established. In this paper, these methods are gen- eralized to inhomogeneous quantum codes.     

Overlap Cycles for Steiner Quadruple Systems

Steiner quadruple systems are set systems in which every triple is contained in a unique quadruple. It is well known that Steiner quadruple systems of order v, or SQS(v), exist if and only if . Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, are a type of cyclic Gray code. Overlap cycles are generalizations of universal cycles that were introduced in 2010 by Godbole, et al. Using Hanani's SQS constructions, we show that for every with there exists an SQS(v) that admits a 1‐overlap cycle.     

Minimal Symmetric Differences of Lines in Projective Planes

Let q be an odd prime power and let be the minimum size of the symmetric difference of r lines in the Desarguesian projective plane . We prove some results about the function , in particular showing that there exists a constant such that for .     

有限域上一类等维码的下界

等维码凭借其在随机线性网络编码中的良好的差错控制得到广泛研究,对于给定维数和最小距离的等维码所含码字的最大个数目前还没有一般性结果.Tuvi Etzion和Alexander Vardy给出了一定等维码所含码字最大个数的上界和下界,首先利用对偶空间构造等维码C(n,M,2k,k),达到了此类码所含码字的下界,然后具体构造了最优等维码C(7,41,4,2).     

几类最优避免冲突码

长度为n重量为w的避免冲突码C是群Z_n的w元子集族,满足对任意的x,y∈C,x≠y有d*(x)∩d*(y)=Φ,其中d*(x)={a-b(mod n):a,b∈x,a≠b}.避免冲突码适用于无反馈时隙同步多址冲突信道.C中的元素称为码字,C中所包含的码字的个数称为码的容量,它是系统中所支持的潜在用户的个数.利用已有的3种构造方法给出了重量在4到10之间的一些最优CAC(p,w)码类.     

Invariants of trace forms in odd characteristic and authentication codes

We complete A. Klapper's work on the invariant of a one-term trace form over a finite field of odd characteristic. We apply this to computing the probability of a successful impersonation attack on an authentication code proposed by C. Ding et al. (2005).