Constructing two-weight codes with prescribed groups of automorphisms

We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.     

关于循环阵列码

本文用代数观点来研究循环阵列码,证明了一般的阵列码是一些极小循环阵列码的直和,并且对极小循环阵列码给出了明确的刻画．当有限域的特征不整除群的阶时,给出了直接写出相应的多项式环的本原幂等元的方法,从而可以直接写出所有的极小循环码．     

Codes Over the p-adic Integers

We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4).     

On Intersection Problem for Perfect Binary Codes

The main result is that to any even integer q in the interval 0 ≤ q ≤ 2^{n+1-2log(n+1)}, there are two perfect codes C₁ and C₂ of length n = 2^m − 1, m ≥ 4, such that |C₁ ∩ C₂| = q.     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

Sampling Consensus of 2nd-Order Multi-Agent Systems Based on Time-Varying Topology北大核心CSCD

基于速度一致位移差保持不变的一致性概念,研究了二阶多智能体系统在时变拓扑下的采样一致性问题。首先,引入虚拟领导者,将具有时变拓扑结构的多智能体系统的采样一致性问题转换为误差系统的采样控制稳定性问题。其次,通过预估采样误差,研究采样误差对系统达到一致性的影响。最后,应用Lyapunov稳定性理论,分析所构造的误差系统的稳定性,并给出该误差系统最终稳定的充分条件。数值仿真结果验证了理论分析的有效性和正确性。     

Two-point AG codes from the Beelen-Montanucci maximal curve

In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.     

Exponential stability of discrete-time systems with slowly time-varying delays

Slowly time-varying delays are seldom, but do need to be, considered in the context of discrete-time systems. This paper addresses the exponential stability issue of discrete-time systems with slowly time-varying delays. The basic idea is to transform, by utilizing the switching transformation approach, the original system with slowly time-varying delays into an equivalent switched system with special switching signal. Different types of delays correspond to different types of switching signals, and the stability issue of the original system is converted into that of a switched system. It is the first time that the method of switched homogeneous polynomial Lyapunov function is applied to general delayed systems. Some sufficient exponential stability conditions for the original system are proposed in several situations. It is numerically shown that the conservativeness of the proposed conditions reduces as the degree of the switched homogeneous polynomial Lyapunov function increases.     

Precise bounds for the petersen time-varying real parameter uncertainty system stabilized via linear static controllers

Using a class of linear static controllers, we stabilize the Petersen open-loop two-dimensional linear system (Ref. 1), which consists of one time-varying uncertainty in the state matrixA and one timevarying uncertainty in the input matrixB. We show that the worst-case uncertainty strategy for the closed-loop system is a piecewise constant strategy of the angular state with three switches on the half-turn, –/2/2; it is unique with respect to a set of measure zero. Formulas are derived for the worst-case half-turn radius gainr _HT as a function of the parameters of the class of stabilizing linear static controllers. Using the class of scalar-quadratic Lyapunov functions, we show that a necessary and sufficient condition for the closed-loop system to be robustly stable against all time-varying admissible uncertainties is thatr _HT be less than unity. The bound on the time-varying real parameter uncertainties for the closed-loop system to be robustly stable is derived for the class of linear static feedback controllers. We obtain stabilizing linear static controllers such that the bound is as close to infinity as desired. The derived results are compared with numerical results obtained using commerical robust-control software.     

Two new bounds on the size of binary codes with a minimum distance of three

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.