• 제목/요약/키워드: codes over Galois ring

검색결과 8건 처리시간 0.022초

ON THE CONSTRUCTION OF MDS SELF-DUAL CODES OVER GALOIS RINGS

  • HAN, SUNGHYU
    • Journal of Applied and Pure Mathematics
    • /
    • 제4권3_4호
    • /
    • pp.211-219
    • /
    • 2022
  • We study MDS(maximum distance separable) self-dual codes over Galois ring R = GR(2m, r). We prove that there exists an MDS self-dual code over R of length n if (n - 1) divides (2r - 1), and 2m divides n. We also provide the current state of the problem for the existence of MDS self-dual codes over Galois rings.

CYCLIC CODES OVER THE RING OF 4-ADIC INTEGERS OF LENGTHS 15, 17 AND 19

  • Park, Young Ho
    • Korean Journal of Mathematics
    • /
    • 제27권3호
    • /
    • pp.767-777
    • /
    • 2019
  • We present a new way of obtaining the complete factorization of $X^n-1$ for n = 15, 17, 19 over the 4-adic ring ${\mathcal{O}}_4[X]$ of integers and thus over the Galois rings $GR(2^e,2)$. As a result, we determine all cyclic codes of lengths 15, 17 and 19 over those rings. This extends our previous work on such cyclic codes of odd lengths less than 15.

THE q-ADIC LIFTINGS OF CODES OVER FINITE FIELDS

  • Park, Young Ho
    • Korean Journal of Mathematics
    • /
    • 제26권3호
    • /
    • pp.537-544
    • /
    • 2018
  • There is a standard construction of lifting cyclic codes over the prime finite field ${\mathbb{Z}}_p$ to the rings ${\mathbb{Z}}_{p^e}$ and to the ring of p-adic integers. We generalize this construction for arbitrary finite fields. This will naturally enable us to lift codes over finite fields ${\mathbb{F}}_{p^r}$ to codes over Galois rings GR($p^e$, r). We give concrete examples with all of the lifts.

REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 2ps OVER GALOIS RINGS

  • Klin-eam, Chakkrid;Sriwirach, Wateekorn
    • 대한수학회보
    • /
    • 제56권1호
    • /
    • pp.131-150
    • /
    • 2019
  • In this paper, we consider the structure of ${\gamma}$-constacyclic codes of length $2p^s$ over the Galois ring $GR(p^a,m)$ for any unit ${\gamma}$ of the form ${\xi}_0+p{\xi}_1+p^2z$, where $z{\in}GR(p^a,m)$ and ${\xi}_0$, ${\xi}_1$ are nonzero elements of the set ${\mathcal{T}}(p,m)$. Here ${\mathcal{T}}(p,m)$ denotes a complete set of representatives of the cosets ${\frac{GR(p^a,m)}{pGR(p^a,m)}}={\mathbb{F}}p^m$ in $GR(p^a,m)$. When ${\gamma}$ is not a square, the rings ${\mathcal{R}}_p(a,m,{\gamma})=\frac{GR(p^a,m)[x]}{{\langle}x^2p^s-{\gamma}{\rangle}}$ is a chain ring with maximal ideal ${\langle}x^2-{\delta}{\rangle}$, where ${\delta}p^s={\xi}_0$, and the number of codewords of ${\gamma}$-constacyclic code are provided. Furthermore, the self-orthogonal and self-dual ${\gamma}$-constacyclic codes of length $2p^s$ over $GR(p^a,m)$ are also established. Finally, we determine the Rosenbloom-Tsfasman (RT) distances and weight distributions of all such codes.