Coding Theory and Algebraic Combinatorics

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. We describe and recapitulate important results in the development of the state of the art. In addition, we give illustrative examples and constructions, and highlight recent advances. Finally, we provide a collection of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in Information and Coding Theory", ed. by I. Woungang et al., World Scientific, Singapore, 201

可換アソシエーションスキームの拡張について

Tohoku University田中太初課

Self-Dual Codes

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators, Gleason-Pierce theorem, invariant theory, Gleason theorems, bounds, mass formulae, enumeration, extremal codes, open problems. There is a comprehensive bibliography.Comment: 136 page

Group rings: Units and their applications in self-dual codes

The initial research presented in this thesis is the structure of the unit group of the group ring Cn x D6 over a field of characteristic 3 in terms of cyclic groups, specifically U(F3t(Cn x D6)). There are numerous applications of group rings, such as topology, geometry and algebraic K-theory, but more recently in coding theory. Following the initial work on establishing the unit group of a group ring, we take a closer look at the use of group rings in algebraic coding theory in order to construct self-dual and extremal self-dual codes. Using a well established isomorphism between a group ring and a ring of matrices, we construct certain self-dual and formally self-dual codes over a finite commutative Frobenius ring. There is an interesting relationships between the Automorphism group of the code produced and the underlying group in the group ring. Building on the theory, we describe all possible group algebras that can be used to construct the well-known binary extended Golay code. The double circulant construction is a well-known technique for constructing self-dual codes; combining this with the established isomorphism previously mentioned, we demonstrate a new technique for constructing self-dual codes. New theory states that under certain conditions, these self-dual codes correspond to unitary units in group rings. Currently, using methods discussed, we construct 10 new extremal self-dual codes of length 68. In the search for new extremal self-dual codes, we establish a new technique which considers a double bordered construction. There are certain conditions where this new technique will produce self-dual codes, which are given in the theoretical results. Applying this new construction, we construct numerous new codes to verify the theoretical results; 1 new extremal self-dual code of length 64, 18 new codes of length 68 and 12 new extremal self-dual codes of length 80. Using the well established isomorphism and the common four block construction, we consider a new technique in order to construct self-dual codes of length 68. There are certain conditions, stated in the theoretical results, which allow this construction to yield self-dual codes, and some interesting links between the group ring elements and the construction. From this technique, we construct 32 new extremal self-dual codes of length 68. Lastly, we consider a unique construction as a combination of block circulant matrices and quadratic circulant matrices. Here, we provide theory surrounding this construction and conditions for full effectiveness of the method. Finally, we present the 52 new self-dual codes that result from this method; 1 new self-dual code of length 66 and 51 new self-dual codes of length 68. Note that different weight enumerators are dependant on different values of β. In addition, for codes of length 68, the weight enumerator is also defined in terms of γ, and for codes of length 80, the weight enumerator is also de ned in terms of α