The Covering Radius of Ternary Cyclic Codes with Length up to 25

The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

转台轴线标定及综合标定矩阵的生成——用于三维计算机视觉系统

提出利用标定平面的两个角度可交出转台轴线,通过交出的轴线,标定出光-象平面轴线的关系,并给出测量点通过平移、旋转再进入标定矩阵的一个新的转换矩阵。     

乒乓球运动中的力学分析

利用力学原理分析了乒乓球的运动方程与击球时作用力、球的速度和位置之间的关系．确定出任意条件下的球的落点．并给出了一些计算结果．     

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

一种信息审计系统中的多关键字匹配算法

针对审计系统中搜索大量审计数据的需要,设计了一种基于哈希表机制的多关键字匹配算法.该算法把关键字集合储存到哈希表中,并为关键字集合建立了两个过滤表和一个关键字长度类型表.在查找过程中,对未经过滤表验证的字符串不再进行匹配查找,同时,关键字长度类型表的使用减少了循环的次数.测试结果表明,该算法在速度和精度上都优于BM和mgrep算法.     

关于笛卡尔积码的广义Hamming重量的分析

在文献[1 0 ] 中 ,由旧码C1 、C2 构造了一类新码C1 C2 ———笛卡尔积码。本文根据文献[1 ]中提出的广义Hamming重量的定义 ,分析了笛卡尔积码与旧码C1 、C2 的广义Hamming重量的关系 ,给出了几个有意义的结果     

局域网中基于ASP的办公信息的采集

办公事务中经常要求采集各种信息，传统的做法是印发数据表、填写数据表、再把数据录入到微机数据库保存和处理；现利用Windows98的PWS和Access数据库，以Weh浏览器和Web服务器交互访问的方式，将局域网上收集的信息直接保存到数据库中．