New linear codes over GF(8)

Let [n, k, d; q]-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). Let d₈(n, k) be the maximum possible minimum Hamming distance of a linear [n, k, d; 8]-code for given values of n and k. In this paper, eighteen new linear codes over GF(8) are constructed which improve the table of d₈(n, k) by Brouwer.     

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.     

Linear cyclic codes of wordlength v over GF(q s ) which are also linear cyclic codes of wordlength sv over GF(q)

Any nonsingular linear transformation : GF(q^s) GF(q^s) can be used to treat a linear cyclic code of wordlength v over GF(q^s) as a linear code () of Wordlength sv over GF(q). This paper determines those linear cyclic codes and transformations for which the resulting linear code () is also cyclic.     

利用有限域GF（2m）上的三项式构造二元循环码

循环码是一类特殊的线性码,由于循环码快速的编码和译码算法,它被广泛应用于消费电子,数据存储以及通信系统当中.在本文中,利用特征是偶数的有限域上的三项式构造出了两类二元循环码,我们不仅可以确定出这两类循环码最小距离的下界,而且这两类循环码在参数的选取上非常的灵活.     

Directed graph representation of half-rate additive codes over GF(4)

We show that (n, 2 ⁿ ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2 ⁿ ) codes over GF(4) of length up to 7. From this we also derive classifications of isodual and formally self-dual codes. We introduce new constructions of circulant and bordered circulant directed graph codes, and show that these codes will always be isodual. A computer search of all such codes of length up to 26 reveals that these constructions produce many codes of high minimum distance. In particular, we find new near-extremal formally self-dual codes of length 11 and 13, and isodual codes of length 24, 25, and 26 with better minimum distance than the best known self-dual codes.     

Tangential 1-blocks over GF(3)

In a fundamental paper on the algebraic theory of graph colouring Tutte [2] proves that the only tangential 1-block over GF(2) is the geometry corresponding to the polygon matroid of the graph K₃. For a good discussion of the problem and a direct proof of Tutte's theorem see Aigner [1, p. 373].

The purpose of this note is to prove the following result.     

Packing problems in Galois geometries over GF(3)

A set of kind s in the Galois space S _r,q is a set of points such that any s+1 are linearly independent but there is at least one subset of s+2 The packing problem is that of finding , the largest size of kind s in S _r,q. The main result is the evaluation of for all sr5. linearly dependent points. Some partial results bounding m ^s _6,3 are also given.     

Combinatorial geometries representable over GF(3) and GF(q). II. Dowling geometries

Letq be an odd prime power not divisible by 3. In Part I of this series, it was shown that the number of points in a rank-n combinatorial geometry (or simple matroid) representable over GF(3) and GF(q) is at mostn ². In this paper, we show that, with the exception ofn = 3, a rank-n geometry that is representable over GF(3) and GF(q) and contains exactlyn ² points is isomorphic to the rank-n Dowling geometry based on the multiplicative group of GF(3).This research was partially supported by the National Science Foundation under Grants DMS-8521826 and DMS-8500494.     

Flag transitive planes of dimension four over GF(3)

Two non desarguesian flag transitive planes of order 3⁴ whose Kernel is GF(3) are constructed. These planes are distinct from the planes of the same order contained in the class constructed by Narayana Rao M. L. (Proceedings of American Mathematical Society 39 (1973) 51–56) and Ebert, G.L. and Baker, R. (Enumeration of two dimensional Flag-Transitive planes, Algebras, Groups and Geometries 3 (1985) 248–257). The Flag Transitive group modulo the scalar collineations of these planes is generated by two elements and is of order 328.     

Binary images of some self-dual codes over GF(2m) with respect to trace-orthogonal basis

The note deals with a class of self-dual binary codes containing external doubly-even codes for lengths 8, 16, 24, 32, 40 and 64. For most of them, our construction also provides a simple method for calculating the distance of the code. To our knowledge, this is the first example of a (64, 32, 12) extermal doubly-even self-dual code.     

Recognition of the Projective Special Linear Group over GF（3）

Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k finite groups G such that G ≌P. In this paper we will prove that the group Lp（3）, where p 〉 3 is a prime number, is at most 2-recognizable.     

Combinatorial geometries representable over GF(3) and GF(q). I. The number of points

Letq be a prime power not divisible by 3. We show that the number of points (or rank-1 flats) in a combinatorial geometry (or simple matroid) of rankn representable over GF(3) and GF(q) is at mostn ². Whenq is odd, this bound is sharp and is attained by the Dowling geometries over the cyclic group of order 2.This research was partially supported by National Science Foundation Grant DMS-8521826 and a North Texas State University Faculty Research Grant.     

On the classification of all self-dual additive codes over GF(4) of length up to 12

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.     

Hamming spaces and maximal self dual codes over GF(q), q=ODD

The group of automorphisms of a Hamming space is determined. Self dual codes over odd characteristic finite field with respect to bilinear forms are treated. Under the subgroup of the monomial group preserving the inner product, we classify the maximal self dual codes overGF(5) with respect to the inner product of dimension ≤8. The Hamming Weight distribution and the order of the automorphism of the code are given. Partially supported by NSERC A8460 and Scarborough College.     

The eight dimensional ovoids over GF(5)

In this article we outline a computer assisted classification of the ovoids in an orthogonal space of the type .

     

Polynomial Basis Multiplication over GF(2 m )

In this paper, we describe, analyze and compare various multipliers. Particularly, we investigate the standard modular multiplication, the Montgomery multiplication, and the matrix–vector multiplication techniques.     

Designs in Additive Codes over GF(4)

In this paper we discuss the security of digital signature schemes based on error-correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to explain why the Xinmei scheme failed, such as the linearity of the signature and the redundancy of public keys. Another weakness is found in the Alabbadi-Wicker scheme, which results in a universal forgery attack against it. This attack shows that the Alabbadi-Wicker scheme fails to implement the necessary property of a digital signature scheme: it is infeasible to find a false signature algorithm D from the public verification algorithm E such that E(D ( )) = for all messages . Further analysis shows that this new weakness also applies to the Xinmei scheme.