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.     

New Constructions of Disjoint Distinct Difference Sets

New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered.     

Representations of integers as sums of powers with increasing exponents

Let(n) be the least integer such thatn may be represented in the formn=x ₁ ² +x ₂ ³ +...+x _(n) ⁽ⁿ⁾⁺¹ wherex ₁,x ₂, ...,x _(n) are natural numbers. We computed(n) forn 250 000 and found that(n) 5 for all thesen exceptn=56, 160 for which(n)=6. Also(n) 4 for 41542<n<=250 000.     

Expressing a prime as difference between two numbers containing all the previous primes

We consider the simultaneous equations $$\begin{gathered} p_1^{\alpha _1 } p_2^{\alpha _2 } ...p_n^{\alpha _n } = P_1 P_2 \hfill \\ p_{n + 1} = P_1 - P_2 \hfill \\ \end{gathered} $$ wherep ₁,p ₂,...,p _n+1 are then+1 first primes and α₁,...,α _n ,P ₁,P ₂ are integers. The equations are solved completely forn≦3 and all solutions given under certain restrictions on the α _i 's forn≦9.     

Linear covering codes and error-correcting codes for limited-magnitude errors

The concepts of a linear covering code and a covering set for the limited-magnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcting codes are also considered for some small-magnitude errors.     

ON GENERALIZATION OF SONAR SEQUENCES AND INTERMODULATION－FREE FREQUENCIES ASSIGNMENT SEQUENCES

ＣＨＥＮＷＥＮＤＥ（陈文德）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，ＣｈｉｎａａｎｄＳｔａｔｅＫｅｙＬａｂｒａｒｙｏｆＩｎｆｏｒｍａｔｉｏｎＳｅｃｕｒ...     

Weight Hierarchies of Linear Codes Satisfying the Chain Condition

The weight hierarchy of a linear [n,k;q] code C over GF(q) is the sequence (d₁,d₂,...,d_k) where d_r is the smallest support of an r–dimensional subcode of C. By explicit construction, it is shown that if a sequence (a₁,a₂,...,a_k) satisfies certain conditions, then it is the weight hierarchy of a code satisfying the chain condition.     

The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>)

We study the weight distribution of the linear codes over GF(q^l) which have generator matrices over GF(q) and their dual codes. As an application we find the weight distribution of the irreducible cyclic (23(2¹≈1), 111) codes over GF(2) for all lnot divisible by 11.