RDRamazan Duran

Ramazan Duran

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ramazan Duran has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An algebraic construction technique for codes over Hurwitz integers

    by Ramazan Duran, Murat Güzeltepe

    Let $\alpha$ be a prime Hurwitz integer. $\mathcal{H}_{\alpha}$, which is the set of residual class with respect to related modulo function in the rings of Hurwitz integers, is a subset of $\mathcal{H},$ which is the set of all Hurwitz integers. In this study, we present an algebraic construction technique, which is a modulo function formed depending on two modulo operations, for codes over Hurwitz integers. We consider left congruent modulo $\alpha,$ and the domain of related modulo function is $\mathbb{Z}_{N(\alpha)},$ which is residual class ring of ordinary integers with $N(\alpha)$ elements. Therefore, we obtain the residue class rings of Hurwitz integers with $N(\alpha)$ size. In addition, we present some results for mathematical notations used in two modulo functions, and for the algebraic construction technique formed depending upon two modulo functions. Moreover, we presented graphs obtained by graph layout methods, such as spring, high-dimensional, and spiral embedding, for the set of the residual class obtained with respect to the related modulo function in the rings of Hurwitz integers.


  • Kodlayıcı Hurwitz Tamsayıları: Küçük Kalanlı Bölme Özelliğine Sahip Hurwitz Tamsayıları

    by Ramazan Duran

    Considering error-correcting codes over Hurwitz integers, prime Hurwitz integers are considered. On the other hand, considering transmission over Gaussian channel, Hurwitz integers, whose the norm is either a prime integer or not a prime integer, are considered. In this study, we consider Hurwitz integers, the greatest common divisor of components of which is one, i.e., primitive Hurwitz integers. We show, with the help of a proposition, that some primitive Hurwitz integers accompanied by a related modulo function are not suitable for constructing Hurwitz signal constellations. To solve this problem, we show, with the help of a proposition, the existence of primitive Hurwitz integers that have the "division with small remainder" property used to construct the Hurwitz constellations. We also call the set of these integers named as "Encoder Hurwitz Integers" set. Moreover, we examine some properties of the mentioned set. In addition, we investigate the performances of Hurwitz signal constellations, which are constructed accompanied by a related modulo function using Hurwitz integers, each component of which is in half-integers, for transmission over the additive white Gaussian noise (AWGN) channel by means of the constellation figure of merit (CFM), average energy, and signal-to-noise ratio (SNR).

  • Open Access

    An Algebraic Construction Technique for Codes over Hurwitz Integers

    by Ramazan Duran, Murat Guzeltepe

    Let {\alpha} be a prime Hurwitz integer. H{\alpha}, which is the set of residual class with respect to related modulo function in the rings of Hurwitz integers, is a subset of H, which is the set of all Hurwitz integers. We consider left congruent module {\alpha} and, the domain of related modulo function in this study is ZN({\alpha}), which is residual class ring of ordinary integers with N({\alpha}) elements, which is the norm of prime Hurwitz integer {\alpha}. In this study, we present an algebraic construction technique, which is a modulo function formed depending on two modulo operations, for codes over Hurwitz integers. Thereby, we obtain the residue class rings of Hurwitz integers with N({\alpha}) size. In addition, we present some results for mathematical notations used in two modulo functions, and for the algebraic construction technique formed depending upon two modulo functions. Moreover, we present graphs obtained by graph layout methods, such as spring, high-dimensional, and spiral embedding, for the set of the residual class obtained with respect to the related modulo function in the rings of Hurwitz integers.

  • Open Access

    Encoder Hurwitz Integers: The Hurwitz integers that have the ”division with small remainder” property

    by Ramazan Duran, Murat Güzeltepe

    The modulo function is used to construct signal constellations over high-dimensional vector spaces such as Gaussian integers, Einstein-Jacobi integers, and quaternion integers. There is a one-to-one relationship between the Euclid division and the modulo function. If the Euclid division works for any quaternion integers, then it has the ”division with small remainder” property. The Hurwitz integers form a subring of ring of quaternions. Hurwitz constellations are constructed by using modulo with primitive Hurwitz integers whose norm is a prime integer. If the norm of Hurwitz integers is not a prime integer, then we can not set up an isomorphism between the residual class ring of ordinary integers and the left (right) equivalence class of Hurwitz integers since the size of sets is to be different. In this study, to solve this problem, we define a new set, named encoder Hurwitz integers, consisting of primitive Hurwitz integers that have the ”division with small remainder” property as an alternative instead of the set of primitive Hurwitz integers. Also, we investigate their performance over additive Gaussian noise (AWGN) channel by means of constellation figure of merit (CFM), average energy, minimum square Euclidean distance, and signal-to-noise ratio (SNR).

  • Open Access

    Encoder Lipschitz Integers: The Lipschitz integers that have the ”division with small remainder” property

    by Ramazan Duran, Murat Güzeltepe

    The residue class set of a Lipschitz integer is constructed by modulo function with primitive Lipschitz integer whose norm is a prime integer, i.e. prime Lipschitz integer. In this study, we consider primitive Lipschitz integer whose norm is both a prime integer and not a prime integer. If the norm of each element of the residue class set of a Lipschitz integer is less than the norm of the primitive Lipschitz integer used to construct the residue class set of the Lipschitz integer, then, the Euclid division algorithm works for this primitive Lipschitz integer. The Euclid division algorithm always works for prime Lipschitz integers. In other words, the prime Lipschitz integers have the ”division with small remainder” property. However, this property is ignored in some studies that have a constructed Lipschitz residue class set that lies on primitive Lipschitz integers whose norm is not a prime integer. In this study, we solve this problem by defining Lipschitz integers that have the ”division with small remainder” property, namely, encoder Lipschitz integers set. Therefore, we can define appropriate metrics for codes over Lipschitz integers. Also, we investigate the performances of Lipschitz signal constellations (the left residue class set) obtained by modulo function with Lipschitz integers, which have the ”division with small remainder” property, over the additive white Gaussian noise (AWGN) channel by agency of the constellation figure of merit (CFM), average energy, and signal-to-noise ratio (SNR).