带仲裁的认证码的一个新构造

基于群在集合上的作用和非线性函数构造了一类新的带仲裁的认证码,计算了该码的各种参数,并在假定收方和发方编码规则服从均匀概率分布的情况下,计算了该码受到的五种攻击成功的概率.     

A construction for t-fold perfect authentication codes with arbitration

Authentication codes with arbitration protect against deceptions from the transmitter and the receiver as well as that from the opponent. An authentication code with arbitration is t-fold perfect if the numbers of decoding rules and encoding rules meet the information-theoretic lower bounds. Pei (Message authentication codes (in Chinese). USCT, Hefei, 2009) pointed out that there has not yet been able to construct t-fold perfect authentication codes with arbitration for \(t > 2\) . In this paper, we define a new design, perfect strong strict restricted partially balanced t-design, and prove that the existence of perfect strong strict restricted partially balanced t-designs implies the existence of t-fold perfect authentication codes with arbitration. Further, we obtain some new infinite classes of t-fold perfect authentication codes with arbitration.     

Two-operation homomorphic perfect sharing schemes over rings

Two-operation homomorphic sharing schemes were introduced by Frankel andDesmedt. They have proved that if the set of keys is a Boolean algebra or a finite field, thenthere does not exist a two-operation homomorphic sharing scheme. In this paper it is provedthat there do not exist perfect two-operation homomorphlc sharing schemes over finite ringswith identities. A necessary condition for the existence of perfect two-operation sharingschemes over finite rings without identities is given.     

利用奇异酉几何构造新的带仲裁的认证码

带仲裁的认证码既要防止敌人的欺骗,又要防止收方和发方的相互欺骗.文章利用有限域上奇异酉几何构造了一个新的带仲裁的认证码,计算了这个码的各种参数.当收方和发方的编码规则按等概率分布选取时,计算出了各种攻击成功的概率.     

Weight distribution of translates of MDS codes

The following is a particular case of a theorem of Delsarte: the weight distribution of a translate of an MDS code is uniquely determined by its firstn–k terms. Here an explicit formula is derived from a completely different approach.     

On the construction of authentication and secrecy codes

We present several recursive constructions for authentication and secrecy codes using t-designs. These constructions are based on combinatorial structures called authentication perpendicular arrays, introduced by Stinson. As a by-product we obtain a method for constructing sets of permutations which are uniform and t-homogeneous for arbitrarily large t. A table of parameters for codes whose existence is known is included.     

Some constructions of linearly optimal group codes

We continue here the research on (quasi)group codes over (quasi)group rings. We give some constructions of [n,n-3,3]_q-codes over F_q for n=2q and n=3q. These codes are linearly optimal, i.e. have maximal dimension among linear codes having a given length and distance. Although codes with such parameters are known, our main results state that we can construct such codes as (left) group codes. In the paper we use a construction of Reed-Solomon codes as ideals of the group ring F_qG where G is an elementary abelian group of order q.     

Linear recurring sequences over modules

The aim of this paper is to extend some fundamental and applied results of the theory of linear recurring sequences over fields to the case of polylinear recurring sequences over rings and modules. Quasi-Frobenius modules and Galois rings play a very special role in this project.     

Defining sets of extended cyclic codes invariant under the affine group

We describe the defining sets of extended cyclic codes of length pⁿ over a field and over the ring of integers modulo p^e admitting the affine group AGL_m(p^t), n=mt, as a permutation group.     

On polyvectors of vector spaces and hyperplanes of projective Grassmannians

We investigate relationships between polyvectors of a vector space V, alternating multilinear forms on V, hyperplanes of projective Grassmannians and regular spreads of projective spaces. Suppose V is an n-dimensional vector space over a field F and that A_n-1,k(F) is the Grassmannian of the (k − 1)-dimensional subspaces of PG(V) (1  ? k ? n − 1). With each hyperplane H of A_n-1,k(F), we associate an (n − k)-vector of V (i.e., a vector of ∧^n−kV) which we will call a representative vector of H. One of the problems which we consider is the isomorphism problem of hyperplanes of A_n-1,k(F), i.e., how isomorphism of hyperplanes can be recognized in terms of their representative vectors. Special attention is paid here to the case n = 2k and to those isomorphisms which arise from dualities of PG(V). We also prove that with each regular spread of the projective space PG(2k-1,F), there is associated some class of isomorphic hyperplanes of the Grassmannian A_2k-1,k(F), and we study some properties of these hyperplanes. The above investigations allow us to obtain a new proof for the classification, up to equivalence, of the trivectors of a 6-dimensional vector space over an arbitrary field F, and to obtain a classification, up to isomorphism, of all hyperplanes of A_5,3(F).     

On smallest covers of finite projective spaces

A t-cover of a finite projective space ℙ is a set of t-dimensional subspaces covering all points of ℙ. Beutelspacher [1] constructed examples of t-covers and proved that his examples are of minimal cardinality. We shall show that all examples of minimal cardinality “look like” the examples of Beutelspacher.     

Bijective linear rank preservers for spaces of matrices over antinegative semirings

We classify the bijective linear operators on spaces of matrices over antinegative commutative semirings with no zero divisors which preserve certain rank functions such as the symmetric rank, the factor rank and the tropical rank. We also classify the bijective linear operators on spaces of matrices over the max-plus semiring which preserve the Gondran-Minoux row rank or the Gondran-Minoux column rank.     

On the genus of real projective spaces

We construct a crystallization of the real projective space whose associated contracted complex is minimal with respect to the number of n-simplexes. Then we compute the regular genus of , which is the minimum genus of a closed connected surface into which a crystallization of regularly embeds. Received: 7 February 2007     

On the order bound of one-point algebraic geometry codes

Let S={s_i}_i∈N⊆N be a numerical semigroup. For each i∈N, let ν(s_i) denote the number of pairs (s_i−s_j,s_j)∈S²: it is well-known that there exists an integer m such that the sequence {ν(s_i)}_i∈N is non-decreasing for i>m. The problem of finding m is solved only in special cases. By way of a suitable parameter t, we improve the known bounds for m and in several cases we determine m explicitly. In particular we give the value of m when the Cohen-Macaulay type of the semigroup is three or when the multiplicity is less than or equal to six. When S is the Weierstrass semigroup of a family {C_i}_i∈N of one-point algebraic geometry codes, these results give better estimates for the order bound on the minimum distance of the codes {C_i}.     

On nilpotent subsemigroups of the matrix semigroup over an antiring

In this paper, nilpotent subsemigroups in the matrix semigroup over a commutative antiring are discussed. Some basic properties and characterizations for the nilpotent subsemigroups are given, and some equivalent conditions for the matrix semigroup over a commutative antiring to have a maximal nilpotent subsemigroup are obtained. Also, the maximal nilpotent subsemigroups in the matrix semigroup are described.     

Multilevel decompositions of functional spaces

A unified abstract framework for the multilevel decomposition of both Banach and quasi-Banach spaces is presented. The characterization of intermediate spaces and their duals is derived from general Bernstein and Jackson inequalities. Applications to compactly supported biorthogonal wavelet decompositions of families of Besov spaces are also given. The first author was partially supported by grants from MURST (40% Analisi Numerica) and ASI (Contract ASI-92-RS-89), whereas the second author was partially supported by grants from MURST (40% Analisi Funzionale) and CNR (Progetto Strategico “Applicazioni della Matematica per la Tecnologia e la Società”).     

On the non-existence of linear codes attaining the Griesmer bound

A lower bound on the size of a set K in PG(3, q) satisfying for any plane of PG(3, q), q4 is given. It induces the non-existence of linear [n,4,n + 1 – q ²]-codes over GF(q) attaining the Griesmer bound for .