Quaternions over Galois rings and their codes
Pierre Lance Tan, Virgilio Sison
Source record
Source: Crossref
Published: May 6, 2026
DOI: 10.13069/jacodesmath.v13i2.221
Open original source ↗Source abstract
It is shown that, if is a Frobenius ring, then the quaternion ring is a Frobenius ring for all units . In particular, if is an odd prime power, then is the semisimple non-commutative matrix ring . Consequently, a homogeneous weight that depends on the field size 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 . 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-, -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.Accepted: 20 December 2025
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.