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.     

A New Simple Ultrahigh Speed Decoding Algorithm for BCH Code

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｍｏｄｅｒｎｄｉｇｉｔａｌｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍｓｏｆｔｅｎｒｅｑｕｉｒｅｅｒｒｏｒ ｆｒｅｅｔｒａｎｓｍｉｓｓｉｏｎ .Ｅｒｒｏｒｃｏｎｔｒｏｌｃｏｄｉｎｇｔｅｃｈｎｏｌｏｇｙｈａｓｂｅｅｎｕｓｅｄｗｉｄｅｌｙｉｎｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍ .Ａｎｄｉｔｈａｓｂｅｅｎｉｍｐｒｏｖｉｎｇｔｈｅｐｅｒｆｏｒｍａｎｃｅｏｆｃｏｍｍｕｎｉｃａｔｉｏｎｓｙｓｔｅｍ ｇｒｅａｔｌｙ ,ｅｓｐｅｃｉａｌｌｙｉｎｗｉｒｅｌｅｓｓｃｏｍｍｕｎｉｃａｔｉｏｎｓｓ…     

Near-barrier fusion reactions induced by α on197Au,193Ir,191Ir,185Re,181Ta,121Sb and69Ga nuclei

Fusion-evaporation cross-sections for the α-induced reactions upon¹⁹⁷Au,¹⁹³Ir,¹⁹¹Ir,¹⁸⁵Re,¹⁸¹Ta,¹²¹Sb and⁶⁹Ga nuclei at bombarding energies near the Coulomb barrier have been measured by off-line observation of the γ-rays emitted in the radioactive decay of the residual nuclei using stacked foil technique. The total fusion cross-section for the systems have been compared with simple statistical model calculations using the code ALICE/91 as well as with the coupled channel calculations that include the β₂ and ν₄ slatic deformations and dynamic couplings of the vibrational/rotational states of the target and the projet tile using the code CCDEF.     

Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72

Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant singly-even codes given have weight enumerators for which extremal codes were not previously known to exist.     

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.     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

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

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（n,m,t）弹性函数,其非线性度为2^n-1-2^n-l/2-1＋2^l/2.nlmax（n-l,m,t）,在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.