Difference systems of sets based on cosets partitions

Difference systems of sets （DSS） are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zv relative to subgroup of order k, where v = km is a composite number. As applications, we obtain some new optimal DSSs.     

Review of public-key cryptosystem based on the error correcting code

The paper review the public-key cryptosystems based on the error correcting codes such as Goppa code, BCH code, RS code, rank distance code, algebraic geometric code as well as LDPC code, and made the comparative analyses of the merits and drawbacks of them. The cryptosystem based on Goppa code has high security, but can be achieved poor. The cryptosystems based on other error correcting codes have higher performance than Goppa code. But there are still some disadvantages to solve. At last, the paper produce an assumption of the Niederreiter cascade combination cryptosystem based on double public-keys under complex circumstances, which has higher performance and security than the traditional cryptosystems.     

Topological conjugacy of constant length substitution dynamical systems

Primitive constant length substitutions generate minimal symbolic dynamical systems. In this article we present an algorithm which can produce the list of injective substitutions of the same length that generate topologically conjugate systems. We show that each conjugacy class contains infinitely many substitutions which are not injective. As examples, the Toeplitz conjugacy class contains three injective substitutions (two on two symbols and one on three symbols), and the length two Thue–Morse conjugacy class contains twelve substitutions, among which are two on six symbols. Together, they constitute a list of all primitive substitutions of length two with infinite minimal systems which are factors of the Thue–Morse system.     

基于均匀设计的海峡两岸高层建筑顺风向风荷载多因素分析

为明确海峡两岸高层建筑顺风向风荷载的异同,对两岸建筑风荷载标准进行了对标分析,并采用均匀设计方法进行了高层建筑顺风向风荷载多因素分析。研究表明:两岸风荷载标准中基本风速取样方法和极值分布参数取值方法存在明显区别,风压高度变化系数分布和不同重现期的设计风速转换系数大致相同,台湾标准给出的湍流强度建议值明显大于大陆标准;台湾标准分类计算建筑物主体和围护结构的设计风压,大陆标准采用统一表达式,两者给出的设计风荷载组合方式区别明显;以基底剪力和基底弯矩作为评价指标,H/(BL)(1/2)(高宽比)、α地面粗糙度指数)、C_g(脉动效应系数)、C_p(风荷载体型系数)和I_z(湍流强度),对高层建筑顺风向风荷载的影响程度依次减小,H/(BL)(1/2)和α为主要影响因素;随H/(BL)(1/2)的增大,C_g对顺风向风荷载的影响逐渐增强,当H/(BL)(1/2)增大到一定程度时,C_g成为主导因素。     

基于循环码的常重复合码的构造

研究给出了一类基于循环码的常重复合码的构造,并利用指数和计算其参数.与相关的常重复合码相比,该码具有更多的码字,且渐近性较好.     

An Alternative Way to Generalize the Pentagon

We introduce the concept of a pentagonal geometry as a generalization of the pentagon and the Desargues configuration, in the same vein that the generalized polygons share the fundamental properties of ordinary polygons. In short, a pentagonal geometry is a regular partial linear space in which for all points x, the points not collinear with the point x, form a line. We compute bounds on their parameters, give some constructions, obtain some nonexistence results for seemingly feasible parameters and suggest a cryptographic application related to identifying codes of partial linear spaces.     

A high-level synthesis based dual-module redundancy with multi-residue detection （DMR-MRD） fault-tolerant method for on-board processing satellite communication systems

On board processing （OBP） satellite systems have obtained more and more attentions in recent years because of their high efficiency and performance.However,the OBP transponders are very sensitive to the high energy particles in the space radiation environments.Single event upset （SEU） is one of the major radiation effects,which influences the satellite reliability greatly.Triple modular redundancy （TMR） is a classic and efficient method to mask SEUs.However,TMR uses three identical modules and a comparison logic,the circuit size becomes unacceptable,especially in the resource limited environments such as OBP systems.Considering that,a new SEU-tolerant method based on residue code and high-level synthesis （HLS） is proposed,and the new method is applied to FIR filters,which are typical structures in the OBP systems.The simulation results show that,for an applicable HLS scheduling scheme,area reduction can be reduced by 48.26％ compared to TMR,while fault missing rate is 0.15％.     

前缀码与极大前缀码的一种新刻画

在语言图Γ(X*)概念的基础上,用新引入的语言竹竿l(X*)和语言竹竿集L(X*)的概念形象地刻画了前缀码与极大前缀码:A是前缀码l(X*)∈L(X*),S_l_((X*))∩A或为单点集或为Φ;A是极大前缀码l(X*)∈L(X*),i)S_(l(X*))∩A或为单点集或为Φ.ii)S_(l(X*))∩A=Φ■u∈S_(l(X*)),■a∈A,ω∈X~+使a=uw.     

On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.