Topics in Integral Matrices and Abelian Group Codes

Citation

Rushanan, Joseph John (1986) Topics in Integral Matrices and Abelian Group Codes. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/CZA5-PX53. https://resolver.caltech.edu/CaltechETD:etd-05022003-113743

Abstract

This thesis consists of two independent chapters.

The first chapter concerns the Smith Normal Form (SNF) over the integers ℤ of integral matrices. We consider the SNF of a matrix A to be the ratio of two ℤ-modules -- a finitely generated abelian group; this is called the Smith group of A. The Smith group provides a unified setting to present both new and old results. The new results concern the relationship between the eigenvalues of an integral matrix and its SNF. In particular, the multiplicities of integer eigenvalues are shown to relate to the multiplicities in the type of the Smith group. Bounds are also given for the exponent of the Smith group. In some cases, these are best possible. The old results discussed are the interlacing of the SNF in the case of augmented matrices and the symmetries of the SNF for certain combinatorial matrices. The latter results are extended to rectangular matrices. Numerous examples are given throughout, along with many conjectures based on computation.

The second chapter generalizes the work of Pless, et al. on duadic codes and Q-codes. We take abelian group codes to be ideals in the group ring F[G], where G is a finite abelian group of odd order n and F is a finite field with characteristic relatively prime to n. We define generalized Q-codes from a pair of idempotents of F[G] and an automorphism of G which together obey two simple equations. These codes are (n, (n+1)/2) and (n, (n-1)/2) linear codes. We show that all of the properties of duadic and Q-codes generalize. In particular, we extend the results on the relationship of these codes to projective planes with regular automorphism group G. When F has characteristic 2, we give simple numerical conditions on G and F which determine when generalized Q-codes exist. We also give some techniques for constructing these codes.

Thesis Files