On perfectt-shift codes in abelian groups

LetG be a finite abelian group,t a positive integer. Thet-shift sphere with centerx G is the setS _t (x)={±ix|i=1,...,t}. At-shift code is a subsetX ofG such that the setsS _t (x) (x X) have size 2t and are disjoint. Clearly, the sphere packing bound: 2t|X|+1|G| holds for anyt-shift codeX. Aperfect t-shift code is at-shift codeX with 2t|X|+1=|G|. A necessary and sufficient condition for the existence of a perfectt-shift code in a finite abelian group is known fort-1, 2. In this paper, we determine finite abelian groups in which there exists a perfectt-shift code fort=3, 4.This research was completed during the author's visit at the Institute for System Analysis, Moscow, as a Heizaemon Honda fellow of the Japan Association for Mathematical Sciences.     

On weights in duadic abelian codes

In this note, we prove that if C is a duadic binary abelian code with splitting μ=μ₋₁ and the minimum odd weight of C satisfies d²−d+1≠n, then d(d−1)n+11. We show by an example that this bound is sharp. A series of open problems on this subject are proposed.     

On abelian difference sets with multiplier — 1

Archiv der Mathematik -     

Minimal codes in abelian group algebras

In this paper we show that two minimal codes $\text{M}$₁ and $\text{M}$₂ in the group algebra $\text{F}$₂[G] have the same (Hamming) weight distribution if and only if there exists an automorphism θ of G whose linear extension to $\text{F}$₂[G] maps $\text{M}$₁ onto $\text{M}$₂. If θ(M₁) = M₂, then $\text{M}$₁ and $\text{M}$₂ are called equivalent. We also show that there are exactly τ(l) inequivalent minimal codes in $\text{F}$₂[G], where ? is the exponent of G, and τ(?) is the number of divisors of ?.     

On the maximum size of a k-zero-free set in an abelian group

A subset A of elements in an abelian group G is called k-zero-free if the equation x ₁ + x ₂ + ... + x _k = 0 has no solution in A. A k-zero-free set A in G is called maximal if A ∪ {x} is k-zero-free for no x ∈ G\A. Some bounds for the maximum size of a k-zero free set are obtained. In particular, we determine the maximum speed of a k-zero-free arithmetic progression in the cyclic group Z _n and find the upper and lower bounds for the maximum size of a k-zero-free set in an abelian group G. We describe the structure of a maximal k-zero-free set A in the cyclic group Z _n provided that gcd(n, k) = 1 and k|A| ≥ n + 1.     

On algebras admitting a complete set of near weights,evaluation codes,and Goppa codes

In 1998 Høholdt, van Lint and Pellikaan introduced the concept of a “weight function” defined on a \({\mathbb{F}_q}\)-algebra and used it to construct linear codes, obtaining among them the algebraic geometry (AG) codes supported on one point. Later, in 1999, it was proved by Matsumoto that all codes produced using a weight function are actually AG codes supported on one point. Recently, “near weight functions” (a generalization of weight functions), also defined on a \({\mathbb{F}_q}\)-algebra, were introduced to study codes supported on two points. In this paper we show that an algebra admits a set of m near weight functions having a compatibility property, namely, the set is a “complete set”, if and only if it is the ring of regular functions of an affine geometrically irreducible algebraic curve defined over \({\mathbb{F}_q}\) whose points at infinity have a total of m rational branches. Then the codes produced using the near weight functions are exactly the AG codes supported on m points. A bound for the minimum distance of these codes is presented with examples which show that in some situations it compares better than the usual Goppa bound.     

Paley type partial difference sets in abelian groups

Partial difference sets with parameters $\left(v,k,\lambda ,\mu \right)=\left(v,\left(v?1\right)/2,\left(v?5\right)/4,\left(v?1\right)/4\right)$ are called Paley type partial difference sets. In this note, we prove that if there exists a Paley type partial difference set in an abelian group of order v, where v is not a prime power, then $v=n^4$ or $9n^4$, $n>1$ an odd integer. In 2010, Polhill constructed Paley type partial difference sets in abelian groups with those orders. Thus, combining with the constructions of Polhill and the classical Paley construction using nonzero squares of a finite field, we completely answer the following question: “For which odd positive integers $v>1$, can we find a Paley type partial difference set in an abelian group of order $v$?”     

A two-to-one map and abelian affine difference sets

Let D be an affine difference set of order n in an abelian group G relative to a subgroup N. Set = H \ {1, ω}, where H = G/N and . Using D we define a two-to-one map g from to N. The map g satisfies g(σ ^m ) = g(σ) ^m and g(σ) = g(σ ⁻¹) for any multiplier m of D and any element σ ∈ . As applications, we present some results which give a restriction on the possible order n and the group theoretic structure of G/N.      

On abelian cubic arcs

Work partially supported by a NATO Grant.     

On abelian principal bundles

Let T be a complex torus and E _T a holomorphic principal T-bundle over a connected complex manifold M. We prove that the total space of E _T admits a K?hler structure if and only if M admits a K?hler structure and E _T admits a flat holomorphic connection whose monodromy preserves a K?hler form on T. If E _T admits a K?hler structure, then is isomorphic to . Received: 2 September 2005