• Title/Summary/Keyword: repeated-root codes

Search Result 3, Processing Time 0.017 seconds

SOME CLASSES OF REPEATED-ROOT CONSTACYCLIC CODES OVER 𝔽pm+u𝔽pm+u2𝔽pm

  • Liu, Xiusheng;Xu, Xiaofang
    • Journal of the Korean Mathematical Society
    • /
    • v.51 no.4
    • /
    • pp.853-866
    • /
    • 2014
  • Constacyclic codes of length $p^s$ over $R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m}$ are precisely the ideals of the ring $\frac{R[x]}{<x^{p^s}-1>}$. In this paper, we investigate constacyclic codes of length $p^s$ over R. The units of the ring R are of the forms ${\gamma}$, ${\alpha}+u{\beta}$, ${\alpha}+u{\beta}+u^2{\gamma}$ and ${\alpha}+u^2{\gamma}$, where ${\alpha}$, ${\beta}$ and ${\gamma}$ are nonzero elements of $\mathbb{F}_{p^m}$. We obtain the structures and Hamming distances of all (${\alpha}+u{\beta}$)-constacyclic codes and (${\alpha}+u{\beta}+u^2{\gamma}$)-constacyclic codes of length $p^s$ over R. Furthermore, we classify all cyclic codes of length $p^s$ over R, and by using the ring isomorphism we characterize ${\gamma}$-constacyclic codes of length $p^s$ over R.

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

  • Klin-eam, Chakkrid;Sriwirach, Wateekorn
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.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.

NEGACYCLIC CODES OF LENGTH 8ps OVER Fpm + uFpm

  • Klin-eam, Chakkrid;Phuto, Jirayu
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.6
    • /
    • pp.1385-1422
    • /
    • 2019
  • Let p be an odd prime. The algebraic structure of all negacyclic codes of length $8_{p^s}$ over the finite commutative chain ring ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8_{p^s}$ over ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ into 5 cases, i.e., $p^m{\equiv}1$ (mod 16), $p^m{\equiv}3$, 11 (mod 16), $p^m{\equiv}5$, 13 (mod 16), $p^m{\equiv}7$, 15 (mod 16) and $p^m{\equiv}9$ (mod 16). From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.