Quaternions over Galois rings and their codes

Read full text
Authors: Pierre Lance Tan, Virgilio P. Sıson
Cited by: 0
References: 9

Abstract

It is shown that, if R is a Frobenius ring, then the quaternion ring ℱa,b(R) is a Frobenius ring for all units a, b ∈ R. In particular, if q is an odd prime power, then ℱa,b(Fq) is the semisimple non-commutative matrix ring M2(Fq). Consequently, a homogeneous weight that depends on the field size q is obtained. Moreover, the homogeneous weight of a finite Frobenius ring with a unique minimal ideal is derived in terms of the size of the ideal. This is illustrated by the quaternions over the Galois ring GR(2r, m). Finally, one-sided linear block codes over the quaternions with coefficients in the Galois ring are constructed, and certain bounds on the homogeneous distance of the images of these codes are proved. These bounds are based on the Hamming distance of the quaternion code and the parameters of the Galois ring. Good examples of one-sided rate-2/6, 3-quasi-cyclic quaternion codes and their images are generated. One of these codes meets the Singleton bound and is therefore a maximum distance separable code.

Fields of Study & Subjects

Coding theory and cryptography graph theory and CDMA systems Cellular Automata and Applications

Publication details

Journal / source
Journal of Algebra Combinatorics Discrete Structures and Applications
Pages
PDF–PDF
Publication date
6 May 2026
Language
EN