About Euclidean Codes in Rings

Authors:
  • KAK. Abdelmoumen
    K. Abdelmoumen
  • HBH. Ben-Azza
    H. Ben-Azza
  • MNM. Najmeddine
    M. Najmeddine

Abstract
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.