新型高功率径向强流速调管振荡器

 提出了一种新结构的高功率径向强流速调管振荡器,该器件利用折叠式同轴谐振腔的微波场与接近空间电荷限制电流的径向电子束强烈相互作用产生高功率微波。首先对这种器件的实现机理进行了初步的分析，提出了有间隙电压情况时的径向同轴间隙的空间电荷限制电流1维近似估计模型。分析表明：对于电子束直流接近但小于直流空间限制电流的径向速调管，当有调制间隙电压时，空间限制电流要小于无调制间隙电压情况下的直流空间限制电流，径向强流电子束电流接近和超过空间电荷限制电流时会出现强烈的调制。然后用PIC程序对其特性进行了粒子模拟，在二极管输入电压500 kV、电子束电流为30 kA条件下，最终得到了峰值功率6 GW、频率1.3 GHz的微波输出。     

Weight distributions of geometric Goppa codes

The in general hard problem of computing weight distributions of linear codes is considered for the special class of algebraic-geometric codes, defined by Goppa in the early eighties. Known results restrict to codes from elliptic curves. We obtain results for curves of higher genus by expressing the weight distributions in terms of -series. The results include general properties of weight distributions, a method to describe and compute weight distributions, and worked out examples for curves of genus two and three.

     

On the Characterization of Linear Uniquely Decodable Codes

A Uniquely Decodable (UD) Code is a code such that any vector of the ambient space has a unique closest codeword. In this paper we begin a study of the structure of UD codes and identify perfect subcodes. In particular we determine all linear UD codes of covering radius 2.     

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.     

On fuzzy subgroups and fuzzy ideals under triangular norms

In this communication, we explicitly point out that the principal results of Liu 1982 basically deduced from the definition of binary operation ° on the set F(X) of all fuzzy subsets of X, also hold if one uses the weaker definition of product under triangular norm °_t. Fuzzy ideals with respect to the triangular norms are also defined.     

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: