On the Automorphism Groups of Affine-Invariant Codes.

Using the classification of finite simple groups, we obtain a condition for a permutation group on a finite field GF(pm) to have the affine group AGL(1,pm) as a subgroup. Applying this result to the automorphism groups of non trivial affine-invariant codes, we prove that these automorphism groups are always subgroups of the general affine group AGL(m,p).     

广义四元数群的Coleman外自同构群

在这篇注记中,我们利用群的射影极限性质证明了广义四元数群的Coleman外自同构群或者是1或者是一个初等阿贝尔2-群.     

Hochschild Cohomology Ring of the Mod-2 Group Ring of the Generalized Quaternion Group

We will determine the ring structure of the Hochschild cohomology HH?( ₂ Q _t ) of the mod-2 group ring  ₂ Q _t for arbitrary generalized quaternion groups Q _t of order 4t by calculating the ordinary cup product in H?(Q _t , _ψ  ₂ Q _t ).     

Codes from Affine Permutation Groups

It is shown that A(22,10) 50, A(23,10) 76, A(25,10) 166, A(26,10) 270, A(29,10) 1460, and A(28,12) 178, where A(n,d) denotes the maximum cardinality of a binary code of length n and minimum Hamming distance d. The constructed codes are invariant under permutations of some affine (or closely related) permutation group and have been found using computer search.     

Constant Weight Codes and Group Divisible Designs

The study of a class of optimal constant weight codes over arbitrary alphabets was initiated by Etzion, who showed that such codes are equivalent to special GDDs known as generalized Steiner systems GS(t,k,n,g) Etzion. This paper presents new constructions for these systems in the case t=2, k=3. In particular, these constructions imply that the obvious necessary conditions on the length n of the code for the existence of an optimal weight 3, distance 3 code over an alphabet of arbitrary size are asymptotically sufficient.     

Structure Theorems for Group Ring Codes with an Application to Self-Dual Codes

Using ideas from the cohomology of finite groups, an isomorphism is established between a group ring and the direct sum of twisted group rings. This gives a decomposition of a group ring code into twisted group ring codes. In the abelian case the twisted group ring codes are (multi-dimensional) constacyclic codes. We use the decomposition to prove that, with respect to the Euclidean inner product, there are no self-dual group ring codes when the group is the direct product of a 2-group and a group of odd order, and the ring is a field of odd characteristic or a certain modular ring. In particular, there are no self-dual abelian codes over the rings indicated. Extensions of these results to non-Euclidean inner products are briefly discussed.     

广义四元数群的4-度Cayley图

一个有限群称为广义四元数群,若Q4n=〈a,b a2n=1,b2=an,ab=a-1,〉n 3.本文根据广义四元数群Q4p(p为奇素数)中只有两类二元生成子集,且它们在Aut(Q4p)的作用下是传递的.结合具体图形,利用查圈的方法重点地证明了广义四元数群关于这两类二元生成子集的4-度C ay ley图的正规性与正则性,解决了4-度C ay ley图的完全分类问题.     

Complex Spherical Designs and Codes

Real spherical designs and real and complex projective designs have been shown by Delsarte, Goethals, and Seidel to give rise to association schemes when the strength of the design is high compared to its degree as a code. In contrast, designs on the complex unit sphere remain relatively uninvestigated, despite their importance in numerous applications. In this paper, we develop the notion of a complex spherical design and show how many such designs carry the structure of an association scheme. In contrast with the real spherical designs and the real and complex projective designs, these association schemes are nonsymmetric.     

The Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields

Affine-invariant codes are extended cyclic codes of length p ^m invariant under the affine-group acting on . This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes berg, bech1. We derive here new results, especially when the alphabet field is an extension field, by expanding our previous tools. In particular we complete our results on BCH codes, giving the automorphism groups of extended narrow-sense BCH codes defined over any extension field.     

Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

We prove the existence of a cyclic (4p, 4, 1)-BIBD—and hence, equivalently, that of a cyclic (4, 1)-GDD of type 4 ^p —for any prime such that (p–1)/6 has a prime factor q not greater than 19. This was known only for q=2, i.e., for . In this case an explicit construction was given for . Here, such an explicit construction is also realized for .We also give a strong indication about the existence of a cyclic (4p 4, 1)-BIBD for any prime , p>7. The existence is guaranteed for p>(2q ³–3q ²+1)²+3q ² where q is the least prime factor of (p–1)/6.Finally, we prove, giving explicit constructions, the existence of a cyclic (4, 1)-GDD of type 6 ^p for any prime p>5 and the existence of a cyclic (4, 1)-GDD of type 8 ^p for any prime . The result on GDD's with group size 6 was already known but our proof is new and very easy.All the above results may be translated in terms of optimal optical orthogonal codes of weight four with =1.     

关于四元数矩阵方程AX=B

本文定义了四元数体Ω上亚半正定矩阵，给出了Ω上矩阵方程ＡＸ＝Ｂ有亚（半）正定解和西矩阵解的充要条件及其解集结构．     

四元矩阵方程AXB＝D的Hermite解

本给出了四元矩阵方程AXB＝D有Hermite解的充要条件，利用A，B，D及它的Moore-penrose逆的一般Hermite解表示。     

广义四元数体上矩阵的最小多项式

本文给出了广义四元数体上方阵的最小多项式与最小中心多项式的构造公式，讨论了它们的性质及其应用，得到广义四元数方阵相似于对角矩阵的一个充要条件。     

自同构群是循环群被交换群扩张的有限群

设Ｃ是有限群，ＡｕｔＧ＝ＡＢ，，Ａ是交换群且每Ｓｙｌｏｗ子群的秩≤２，Ｂ是循环群，本文得出了Ｇ的结构，特别地，证明了ＡｕｔＧ是秩≤２的交换群时，Ｇ循环。     

四元数矩阵的惯性定理与稳定性

本文给出了四元数矩阵惯性的定义,讨论了四元数体上Lyapunov矩阵方程的唯一解,推广了一般惯性定理、Lyapunov稳定性定理、Carlson-Schneider定理、Stein稳定性定理等一些重要的结果到四元数矩阵,同时得出了四元数体上稳定矩阵的一些判别条件.     

Factorizations of Self-similar Groups Associated to the First Grigorchuk Group

In this paper, we construct two self-similar groups factorizable by their locally finite 2-subgroups, generators of which are constructed from the generators of the first Grigorchuk group. Both groups contain the first Grigorchuk group, the second also contains the binary adding machine. The first group is a 2-group but not locally finite and the second group is neither locally finite nor a 2-group. Therefore each of them is a new example providing a negative answer to well-known solved problems. Surprisingly, definitions of both groups involve the Gray code.     

Linear Perfect Codes and a Characterization of the Classical Designs

A new definition for the dimension of a combinatorial t-(v,k,) design over a finite field is proposed. The complementary designs of the hyperplanes in a finite projective or affine geometry, and the finite Desarguesian planes in particular, are characterized as the unique (up to isomorphism) designs with the given parameters and minimum dimension. This generalizes a well-known characterization of the binary hyperplane designs in terms of their minimum 2-rank. The proof utilizes the q-ary analogue of the Hamming code, and a group-theoretic characterization of the classical designs.     

四元数矩阵方程AX=B的实部半正定解(英文)

一个ｎ×ｎ实四元数矩阵称为实部半正定（或正定）矩阵，如果对于任意的非零ｎ维四元数列向量ｘ，有Ｒｅ［ｘＡｘ］≥０（或＞０）．本文给出了四元数矩阵方程ＡＸ＝Ｂ有实部半正定（或正定）矩阵解的充要条件及其通解的表达式，并给出了四元数分块阵为实部半正定（或正定）矩阵的一个判别法则     

Quasideterminant Characterization of MDS Group Codes over Abelian Groups

A group code defined over a group G is a subset of Gⁿ which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Separable) linear codes over finite fields is generalized to MDS group codes over abelian groups, using the notion of quasideterminants defined for matrices over non-commutative rings.