Construction of long MDS self-dual codes from short codes

In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.     

PN结物理特性的开放式测量实验方法研究

开放式、综合性量测实验的设计与应用,在巩固基础理论知识的同时,能够有效培养学生的动手实践能力、数据处理及分析能力,一定程度代表着大学物理实验课程的教学模式改革方向。以PN结物理特性的测量实验为例,基于通用型仪器与元器件的积木式组合,设计出简单、适用的实验电路;t=17.95℃时所采集的原始实验数据经三种模式回归分析,比较验证了PN结扩散电流与电压间遵循的玻尔兹曼分布律;计算出的玻尔兹曼常数与FD-PN-4测定仪的量测值相比,其结果说明了开放式测量实验方法的有效性。     

New lower bounds on the size of (n,r)‐arcs in PG(2,q)

An $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ is a set of $n$ points such that each line contains at most $r$ of the selected points. It is well known that $\left(n,r\right)$‐arcs in $\text{PG}\left(2,q\right)$ correspond to projective linear codes. Let $m_r\left(2,q\right)$ denote the maximal number $n$ of points for which an $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ exists. In this paper we obtain improved lower bounds on $m_r\left(2,q\right)$ by explicitly constructing $\left(n,r\right)$‐arcs. Some of the constructed $\left(n,r\right)$‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.     

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.