Kernels and <Emphasis Type="Italic">p</Emphasis>-Kernels of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>-ary 1-Perfect Codes

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over as well as over the prime field , are established. Q-ary 1-perfect codes of length n=(q^m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.Communicated by: I.F. Blake     

(6,3)-MDS Codes over an Alphabet of Size 4

An (n,k)_q-MDS code C over an alphabet (of size q) is a collection of q^k n–tuples over such that no two words of C agree in as many as k coordinate positions. It follows that n ≤ q+k−1. By elementary combinatorial means we show that every (6,3)₄-MDS code, linear or not, turns out to be a linear (6,3)₄-MDS code or else a code equivalent to a linear code with these parameters. It follows that every (5,3)₄-MDS code over must also be equivalent to linear.     

Cyclic Difference Packing and Covering Arrays

Let n and k be positive integers. Let C_q be a cyclic group of order q. A cyclic difference packing (covering) array, or a CDPA(k, n; q) (CDCA(k, n; q)), is a k × n array (a_ij) with entries a_ij (0 ≤ i ≤ k−1, 0 ≤ j ≤ n−1) from C_q such that, for any two rows t and h (0 ≤ t < h ≤ k−1), every element of C_q occurs in the difference list at most (at least) once. When q is even, then n ≤ q−1 if a CDPA(k, n; q) with k ≥ 3 exists, and n ≥ q+1 if a CDCA(k, n; q) with k ≥ 3 exists. It is proved that a CDCA(4, q+1; q) exists for any even positive integers, and so does a CDPA(4, q−1; q) or a CDPA(4, q−2; q). The result is established, for the most part, by means of a result on cyclic difference matrices with one hole, which is of interest in its own right.     

A new extension theorem for 3-weight modulo q linear codes over $${\mathbb{F}_ q}$$

We prove that every [n, k, d] _q code with q ≥ 4, k ≥ 3, whose weights are congruent to 0, −1 or −2 modulo q and is extendable unless its diversity is for odd q, where .      

Codes that attain minimum distance in every possible direction

The following problem motivated by investigation of databases is studied. Let be a q-ary code of length n with the properties that has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.      

Euclidean and Hermitian LCD MDS codes

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. On the other hand, being optimal codes, maximum distance separable codes (abbreviated MDS) are of much interest from many viewpoints due to their theoretical and practical properties. However, little work has been done on LCD MDS codes. In particular, determining the existence of q-ary [n, k] LCD MDS codes for various lengths n and dimensions k is a basic and interesting problem. In this paper, we firstly study the problem of the existence of q-ary [n, k] LCD MDS codes and solve it for the Euclidean case. More specifically, we show that for \(q>3\) there exists a q-ary [n, k] Euclidean LCD MDS code, where \(0\le k \le n\le q+1\), or, \(q=2^{m}\), \(n=q+2\) and \(k= 3 \text { or } q-1\). Secondly, we investigate several constructions of new Euclidean and Hermitian LCD MDS codes. Our main techniques in constructing Euclidean and Hermitian LCD MDS codes use some linear codes with small dimension or codimension, self-orthogonal codes and generalized Reed-Solomon codes.     

On a More General Characterisation of Steiner Systems

We introduce [k,d]-sparse geometries of cardinality n, which are natural generalizations of partial Steiner systems PS(t,k;n), with d=2(k−t+1). We will verify whether Steiner systems are characterised in the following way. (*) Let be a [k,2(k−t+1)]-sparse geometry of cardinality n, with k \> t \> 1$$" align="middle" border="0"> . If , then Γ is a S(t,k;n). If (*) holds for fixed parameters t, k and n, then we say S(t,k;n) satisfies, or has, characterisation (*). We could not prove (*) in general, but we prove the Theorems 1, 2, 3 and 4, which state conditions under which (*) is satisfied. Moreover, we verify characterisation (*) for every Steiner system appearing in list of the sporadic Steiner systems of small cardinality, and the list of infinite series of Steiner systems, both mentioned in the latest edition of the book ‘Design Theory’ by T. Beth, D. Jungnickel and H. Lenz. As an interesting application, one can use these results to build (almost) maximal binary codes in the following way. Every [k,d]-sparse geometry is associated with a [k,d]-sparse binary code of the same size (let and link every block with the code word where c_i=1 if and only if the point p_i is a member of B), so one can construct maximal [k,d]-sparse binary codes using (partial) Steiner systems. These [k,d]-sparse codes can then be used as building bricks for binary codes having a bigger variety of weights (the weight of a code word is the sum of its entries).     

On (q 2 + q + 2, q + 2)-arcs in the Projective Plane PG(2, q)

A (k,n)-arc in PG(2,q) is usually defined to be a set of k points in the plane such that some line meets in n points but such that no line meets in more than n points. There is an extensive literature on the topic of (k,n)-arcs. Here we keep the same definition but allow to be a multiset, that is, permit to contain multiple points. The case k=q ²+q+2 is of interest because it is the first value of k for which a (k,n)-arc must be a multiset. The problem of classifying (q ²+q+2,q+2)-arcs is of importance in coding theory, since it is equivalent to classifying 3-dimensional q-ary error-correcting codes of length q ²+q+2 and minimum distance q ². Indeed, it was the coding theory problem which provided the initial motivation for our study. It turns out that such arcs are surprisingly rich in geometric structure. Here we construct several families of (q ²+q+2,q+2)-arcs as well as obtain some bounds and non-existence results. A complete classification of such arcs seems to be a difficult problem.     

A new extension theorem for linear codes

For an [n,k,d]_q code with k3, gcd(d,q)=1, the diversity of is defined as the pair (Φ₀,Φ₁) with

All the diversities for [n,k,d]_q codes with k3, d−2 (mod q) such that A_i=0 for all i0,−1,−2 (mod q) are found and characterized with their spectra geometrically, which yields that such codes are extendable for all odd q5. Double extendability is also investigated.     

A Symmetric Function Resolution of the Number of Permutations With Respect to Block-Stable Elements

We consider a question raised by Suhov and Voice from quantum information theory and quantum computing. An element of a partition of {1, ..., n} is said to be block-stable for if it is not moved to another block under the action of π. The problem concerns the determination of the generating series for elements of with respect to the number of block-stable elements of a canonical partition of a finite n-set, with block sizes k₁, ..., k_r, in terms of the moment (power) sums p_q(k₁, ..., k_r). We also consider the limit subject to the condition that exists for q = 1, 2,.... Received January 31, 2006     

On the minimum length of some linear codes

We determine the minimum length n _q (k, d) for some linear codes with k ≥ 5 and q ≥ 3. We prove that n _q (k, d) = g _q (k, d) + 1 for when k is odd, for when k is even, and for . This work was supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD). (KRF-2005-214-C00175). This research has been partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 17540129.     

A New Approach to the Main Conjecture on Algebraic-Geometric MDS Codes

The Main Conjecture on MDS Codes statesthat for every linear [n, k] MDS code over q, if 1 <k < q, then n q+1,except when q is even and k=3 or k=q-1,in which cases n q +2. Recently, there has beenan attempt to prove the conjecture in the case of algebraic-geometriccodes. The method until now has been to reduce the conjectureto a statement about the arithmetic of the jacobian of the curve,and the conjecture has been successfully proven in this way forelliptic and hyperelliptic curves. We present a new approachto the problem, which depends on the geometry of the curve afteran appropriate embedding. Using algebraic-geometric methods,we then prove the conjecture through this approach in the caseof elliptic curves. In the process, we prove a new result aboutthe maximum number of points in an arc which lies on an ellipticcurve.     

Semilinear representations of PGL

Let L be the function field of a projective space over an algebraically closed field k of characteristic zero, and H be the group of projective transformations. An H-sheaf on is a collection of isomorphisms for each g ∈ H satisfying the chain rule. We construct, for any n > 1, a fully faithful functor from the category of finite-dimensional L-semilinear representations of H extendable to the semigroup End(L/k) to the category of coherent H-sheaves on The paper is motivated by a study of admissible representations of the automorphism group G of an algebraically closed extension of k of countable transcendence degree undertaken in [4]. The semigroup End(L/k) is considered as a subquotient of G, hence the condition on extendability. In the appendix it is shown that, if is either H, or a bigger subgroup in the Cremona group (generated by H and a certain pair of involutions), then any semilinear of degree one is an integral L-tensor power of It is also shown that this bigger subgroup has no non-trivial representations of finite degree if n > 1.     

Localizations of Transfors

Let be n-dimensional teisi, i.e., higher-dimensional Gray-categorical structures. The following questions can be asked. Does a left q-transfor , i.e., a functor 2 _q , induce a right q-transfor , i.e., a functor More generally, does a functor induce a functor For k-arrows c and whose (k – 1)-sources and targets agree, does a q-transfor induce a q-transfor , for appropriate k-arrows For k-arrows c and whose (k – 1)-sources and targets agree, does a q-transfor induce a (q + k + 1)-transfor , for appropriate k-arrows I give answers to these questions in the cases where n-dimensional teisi and their tensor product have been defined, i.e., for n 3, and for n up to 5 in some cases that do not need all data and axioms of n-dimensional teisi.I apply the above to compositions in teisi, in particular to braidings and syllepses. One of the results is that a braiding on a monoidal 2-category induces a pseudo-natural transformation , where is the reverse of ? –, which is almost, but not quite, equal to – ?. However, in higher dimensions need not be reversible, so a braiding on a higher-dimensional tas can not be seen as a transfor A B B A.     

Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

A conflict-avoiding code (CAC) C of length n and weight k is a collection of k-subsets of such that holds for any , , where . A CAC with maximum code size for given n and k is called optimal. Furthermore, an optimal CAC C is said to be tight equi-difference if holds and any codeword has the form . The concept of a CAC is motivated from applications in multiple-access communication systems. In this paper, we give a necessary and sufficient condition to construct tight equi-difference CACs of weight k = 3 and characterize the code length n’s admitting the condition through a number theoretical approach.      

A Ricci inequality for hypersurfaces in the sphere

Let Mⁿ be a complete Riemannian manifold immersed isometrically in the unity Euclidean sphere In [9], B. Smyth proved that if Mⁿ, n ≧ 3, has sectional curvature K and Ricci curvature Ric, with inf K > −∞, then sup Ric ≧ (n − 2) unless the universal covering of Mⁿ is homeomorphic to Rn or homeomorphic to an odd-dimensional sphere. In this paper, we improve the result of Smyth. Moreover, we obtain the classification of complete hypersurfaces of with nonnegative sectional curvature.Received: 11 November 2003     

Self-dual sets of type (m, n) in projective spaces

In this paper we introduce and analyze the notion of self-dual k-sets of type (m, n). We show that in a non-square order projective space such sets exist only if the dimension is odd. We prove that, in a projective space of odd dimension and order q, self-dual k-sets of type (m, n), with , are of elliptic and hyperbolic type, respectively. As a corollary we obtain a new characterization of the non-singular elliptic and hyperbolic quadrics.     

Herz Classes and Toeplitz Operators in the Disk

In this paper we decompose into diadic annuli and consider the class S_p,q of Toeplitz operators T_φ for which the sequence of Schatten norms belongs to ℓ^q, where φ_n = φχ A_n. We study the boundedness and compactness of the operators in S_p,q and we describe the operators T_φ , φ ≥ 0 in these spaces in terms of weighted Herz norms of the averaging operator of the symbols φ.     

Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4 ?2q2 ?2q+1 ≤ d≤ q4?2q2 ?q

We prove that there does not exist a [q⁴+q³−q²−3q−1, 5, q⁴−2q²−2q+1]_q code over the finite field for q≥ 5. Using this, we prove that there does not exist a [g_q(5, d), 5, d]_q code with q⁴ −2q² −2q +1 ≤ d ≤ q⁴ −2q² −q for q≥ 5, where g_q(k,d) denotes the Griesmer bound.MSC 2000: 94B65, 94B05, 51E20, 05B25