Near-barrier fusion reactions induced by α on197Au,193Ir,191Ir,185Re,181Ta,121Sb and69Ga nuclei

Fusion-evaporation cross-sections for the α-induced reactions upon¹⁹⁷Au,¹⁹³Ir,¹⁹¹Ir,¹⁸⁵Re,¹⁸¹Ta,¹²¹Sb and⁶⁹Ga nuclei at bombarding energies near the Coulomb barrier have been measured by off-line observation of the γ-rays emitted in the radioactive decay of the residual nuclei using stacked foil technique. The total fusion cross-section for the systems have been compared with simple statistical model calculations using the code ALICE/91 as well as with the coupled channel calculations that include the β₂ and ν₄ slatic deformations and dynamic couplings of the vibrational/rotational states of the target and the projet tile using the code CCDEF.     

Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72

Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant singly-even codes given have weight enumerators for which extremal codes were not previously known to exist.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

Codes with a Certain Weight-preserving Transitive Group of Automorphisms

We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C. Michael Giudici - The author holds an Australian Postdoctoral Fellowship.     

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over F_q of length qⁿ defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.     

The largest strongly consecutive repeat-free code

Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]ⁿ.     

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（n,m,t）弹性函数,其非线性度为2^n-1-2^n-l/2-1＋2^l/2.nlmax（n-l,m,t）,在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.     

Reconfiguration Aspects and a Reconfigurable Outer Block Interleaver for 3G Applications

Reconfiguration concept represents reconfigurable functionalities of the radio interface for mobile radio systems. Particularly for the physical layer, some possible reconfigurable architectures can be identified. We focus on outer interleaving for turbo codes, which can improve their performance in flat Rayleigh fading environment. The larger the number of columns in the outer interleaver, the better is the performance, but with the penalty of more complexity and delay. Furthermore, an incorrect choice of the number of columns can increase the bit and frame error rates. Therefore, it would be advantageous to reconfigure the outer interleaver in different operating environments with the optimum number of columns. Using two different data frame lengths, in this contribution simulation results are presented for the four possible outer block interleaver configurations specified for the 3GPP mobile standard in the case of flat Rayleigh fading channel. It is shown that different operating environments require an optimum number of columns in terms of bit error rate and frame error rate performance. Finally, frame fade duration is considered and the effect of the product of the Doppler frequency with the frame duration on the performance for the four different 3GPP outer block interleaver configurations is discussed. Costas Chaikalis was born in Athens, Greece, on March 7, 1973. He received the B.Sc. degree in electrical engineering in 1995 from Technological Educational Institute of Lamia, Greece. He also received the M.Sc. and Ph.D. degrees from Department of Electronics and Telecommunications, University of Bradford, Bradford, UK in 1999 and 2003, respectively. During his doctoral studies he worked as a Research Assistant for Mobile Virtual Center of Excellence (Mobile VCE), Terminals Group, UK. Since 2003, he is a lecturer in the Department of Electrical Engineering, Technological Educational Institute of Lamia, Greece. His research interests are in all areas of mobile communications but especially in forward error correction coding, reconfigurable (software radio) architectures, cross layer architectures and DSP applications.     

试题质量评价研究

教学过程的规范化管理是保证教学质量的重要手段。考试是对教和学的效果的检验，是教学过程管理规范化必须要解决的问题，一直受到教学管理部门的重视，采取了多项措施解决有关问题，其中一个重要的手段是采用试题库。在采用试题库时，必须要有高质量的试题作保证。本探讨基于KDD技术的试题质量评价方法和指标，并通过实例来说明其有效性。