About Euclidean Codes in Rings
K. Abdelmoumen, H. Ben-azza & M. Najmeddine · Journal of Advances in Mathematics and Computer Science · 2014
In this paper, we construct codes over rings which have a Euclidean division, in the commutative and non commutative cases. Such construction generalizes Reed-Solomon codes. We exemplify the construction for Gaussian integers and Lipschitz quaternions.
Open access
Research Article
10.9734/BJMCS/2014/8887