二元DNA Hamming码的设计及分析

DNA计算作为一种新的计算模式,有着强大的计算能力。实验表明,有效的编码可以提高DNA计算的可靠性,从而保证DNA计算的成功率。二元Hamming码是一类达到Hamming界的好码,也是仅有的两类完全码中的一类。文中基于纠错码编码理论给出了二元DNA Hamming码的设计过程,并进一步分析了所设计的二元DNA Hamming码的性质及其优点。     

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

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

Fast reused code tracing method based on simhash and inverted index

A novel method for fast and accurately tracing reused code was proposed. Based on simhash and inverted in-dex, the method can fast trace similar functions in massive code. First of all, a code database with three-level inverted in-dex structures was constructed. For the function to be traced, similar code blocks could be found quickly according to simhash value of the code block in the function code. Then the potential similar functions could be fast traced using in-verted index. Finally, really similar functions could be identified by comparing jump relationships of similar code blocks. Further, malware samples containing similar functions could be traced. The experimental results show that the method can quickly identify the functions inserted by compilers and the reused functions based on the code database under the premise of high accuracy and recall rate.     

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.     

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

在语言图Γ(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.     

The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length

Let ${\mathbb{F}}_{2^m}$ be a finite field of cardinality $2^m$, $R={\mathbb{F}}_{2^m}\left[u\right]∕〈u^4〉={\mathbb{F}}_{2^m}+u{\mathbb{F}}_{2^m}+u^2{\mathbb{F}}_{2^m}+u^3{\mathbb{F}}_{2^m}$ $(u^4=0)$ which is a finite chain ring, and $n$ is an odd positive integer. For any $\delta ,\alpha \in {\mathbb{F}}_{2^m}^{\times }$, an explicit representation for the dual code of any $(\delta +\alpha u^2)$-constacyclic code over $R$ of length $2n$ is given. And some dual codes of $(1+u^2)$-constacyclic codes over $R$ of length 14 are constructed. For the case of $\delta =1$, all distinct self-dual $(1+\alpha u^2)$-constacyclic codes over $R$ of length $2n$ are determined.