Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics

An ordered list of binary words of length n is called a distance-preserving m, n-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.     

Calculation of the Electron Efficiency for a Two-Cavity Gyroklystron Amplifier by Using a Self-Consistent Code

The beam-wave interaction in a Ka-band, two-cavity fundamental gyroklystron amplifier is studied by using a self-consistent nonlinear simulation code. The electron efficiency for this gyroklystron amplifier is calculated, and the effect of various parameters, such as beam voltage, beam current, electron guiding center radius, velocity pitch ratio and drift tube length on the electron efficiency is discussed in detail.     

Performance of run-length limited (4, 18) code for optical storage systems

In this paper, the authors investigate the performance of recently presented run-length limited (4, 18) code for high density optical storage systems. The construction of the code is described simply. The code has code rate R = 1/3 and density ratio (DR) = 1.67. The bit error rate (BER) performance for decision feedback equalizer (DFE) and partial response maximum likelihood (PRML) detector are simulated, considering signal-to-noise ratio (SNR) and optical channel jitter. The result shows that the performance of the code is acceptable. The encoder and decoder of the code are implemented by complex programmable logic device (CPLD) chip and the hardware resources required for encoder and decoder arelow.     

Generalized Steiner Systems GS(2, 4, v, 2) with v a Prime Power ≡ 7 (mod 12)

Generalized Steiner systems GS(2, 4, v, g) were first introduced by Etzion and were used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 5, in which each codeword has length v and weight 4. Etzion conjectured that the necessary conditions v 1 (mod 3) and v ; 7 are also sufficient for the existence of a GS(2,4,v,2). Except for the example of a GS(2,4,10,2) and some recursive constructions given by Etzion, nothing else is known about this conjecture. In this paper, Weil's theorem on character sum estimates is used to show that the conjecture is true for any prime power v 7 (mod 12) except v = 7, for which there does not exist a GS(2,4,7,2).     

A Gap in GRM Code Weight Distributions

The weight distribution of GRM (generalized Reed-Muller) codes is unknown in general. This article describes and applies some new techniques to the codes over F3. Specifically, we decompose GRM codewords into words from smaller codes and use this decomposition, along with a projective geometry technique, to relate weights occurring in one code with weights occurring in simpler codes. In doing so, we discover a new gap in the weight distribution of many codes. In particular, we show there is no word of weight 3^m–2 in GRM₃(4,m) for m>6, and for even-order codes over the ternary field, we show that under certain conditions, there is no word of weight d+, where d is the minimum distance and is the largest integer dividing all weights occurring in the code.     

Uniformly Packed Codes and More Distance Regular Graphs from Crooked Functions

Let V and W be n-dimensional vector spaces over GF(2). A function Q : V W is called crooked (a notion introduced by Bending and Fon-Der-Flaass) if it satisfies the following three properties:

Multiple access interference cancellation in Manchester-coded synchronous optical PPM-CDMA network

A new interference cancellation technique for direct-detection optical code- division multiple-access (OCDMA) network employing pulse-position modulation (PPM) is proposed in this paper. The multiple access interference (MAI) estimation is achieved by pre-reserving one of optical spreading code sequences at the receiver based on the correlation property of padded modified prime codes (PMPC). The estimated interference is then cancelled out after photo-detection process. Additionally, the transmitted signal is Manchester-coded to further improve the system performance. Based on this proposed interference canceller in a shot-noise limited regime, we have obtained an expression for the upper bound of the bit-error probability (BEP) taking into account effects of both MAI and shot-noise. This BEP is compared with that of a PPM-OCDMA without cancellation. Finally, the receiver structure of the proposed optical network unit (ONU) is fairly simple to compare with the conventional cancellation schemes.     

基于三种调制模式下的turbo码光无线通信系统分析

从分析大气对光无线通信系统的影响出发,研究了大气信道特性,建立了大气信道信噪比和能见度的关系.为降低系统误码率,提出了基于OOK、BPSK、BPPM三种调制模式的turbo码的编码方案,推导出三种不同方案对应的turbo码迭代MAP算法.应用建立的信噪比关系,分析和计算了基于三种不同方案的系统的误码率.结果表明,基于BPSK的turbo码系统比OOK和BPPM系统的信噪比降低约3dB,且在高的信噪比情况下,BPSK系统能显著降低系统的误码率.因此,基于BPSK的turbo码方案较适合光无线通信系统.     

Novel family of prime codes for synchronous optical CDMA

In this paper we have proposed a novel prime spreading sequence family hereby referred to as “new-Modified Prime Code (n-MPC)” for direct-detection synchronous optical code-division multiple-access (OCDMA) networks. The new code has been applied to Overlapping Pulse-Position Modulation (OPPM) CDMA system and the performance of system is evaluated. In addition, we have analyzed the system throughput and also introduced a new interference cancellation technique which significantly improves the bit error probability (BEP) of OPPM-OCDMA systems.     

A novel super-FEC code based on concatenated code for high-speed long-haul optical communication systems

The structures of the novel super forward error correction (Super-FEC) code type based on the concatenated code for high-speed long-haul optical communication systems are studied in this paper. The Reed-Solomon (RS) (255, 239) + Bose-Chaudhuri-Hocguenghem (BCH) (1023, 963) concatenated code is presented after the characteristics of the concatenated code and the two Super-FEC code type presented in ITU-T G.975.1 have theoretically been analyzed, the simulation result shows that this novel code type, compared with the RS (255, 239) + convolutional-self-orthogonal-code (CSOC) (k₀/n₀ = 6/7, J = 8) code in ITU-T G.975.1, has a lower redundancy and better error-correction capabilities, and its net coding gain (NCG) at the third iteration is 0.57 dB more than that of RS (255, 239) + CSOC (k₀/n₀ = 6/7, J = 8) code in ITU-T G.975.1 at the third iteration for the bit error rate (BER) of 10⁻¹². Therefore, the novel code type can better be used in long-haul, larger capacity and higher bit-rate optical communication systems. Furthermore, the design and implementation of the novel concatenated code type are also discussed.