About Euclidean Codes in Rings
K. Abdelmoumen, H. Ben-azza, M. Najmeddine
Journal of Advances in Mathematics and Computer Science · pp. 1356–1364 · Published 21 Mar 2014
10.9734/BJMCS/2014/8887Abstract
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.
Cited by 12
Ramazan Duran, Murat Güzeltepe · 2021
Ramazan Duram, Murat Güzeltepe · 2021
Ramazan Duran, Murat Güzeltepe · 2022
Ramazan Duran, Murat Guzeltepe · Rendiconti del Circolo Matematico di Palermo Series 2 · 2024
Ramazan Duram, Murat Güzeltepe · 2021
Jurgen Freudenberger, Sergo Shavgulidze · IEEE Transactions on Communications · 2015
Ramazan Duram, Murat Güzeltepe · 2021
Ramazan DURAN · Sakarya University Journal of Science · 2023
Showing 8 of 12 known citations — external sources report more than can currently be individually listed.
Related research
- Tetranacci and Tetranacci-Lucas Quaternions — shares topic coverage
- Equilibria in Quantum Three-Player Dilemma Game — shares topic coverage
- A Binary Block Code Generated by JU-Algebras — shares topic coverage
Article metrics
Real usage data collected on this platform.
32
Page views
0
PDF downloads
4
Outbound clicks
12
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.