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]ⁿ.     

基于低功耗双边沿D触发器的任意进制异步计数器设计

从D触发器激励表入手，分别给出了采用单边沿D触发器和双边沿D触发器的2^n进制异步加法计数器、减法计数器的设计方法．在此基础上，采用逻辑函数修改技术，通过实例讨论了基于单边沿D触发器和双边沿D触发器的异步任意进制计数器的设计．该设计方法方便，快速，具有一定的实用意义．     

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（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.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

一种带时间窗和车辆数目限制的车辆路线问题及其算法

本文提出了带时间窗和车辆数目限制的车辆路线问题的数学模型,针对该问题的特征构造了一种路线生成算法和禁忌搜索算法,并对Solomon提出的C1、R1、RC1类数据集给出了数值运算的结果,实验结果表明算法是有效的.     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

Review of chiral perturbation theory

A review of chiral perturbation theory and recent developments on the comparison of its predictions with experiment is presented. Some interesting topics with scope for further elaboration are touched upon.