<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05994106</id>
  <dt>j</dt>
  <an>05994106</an>
  <augroup>
    <au>Matsuoka, Manabu</au>
  </augroup>
  <ti>$\theta$-polycyclic codes and $\theta$-sequential codes over finite fields.</ti>
  <so>Int. J. Algebra 5, No. 1-4, 65-70 (2011).</so>
  <py>2011</py>
  <pu>Hikari Ltd, Ruse</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>finite fields</ut>
    <ut>$\theta $-polycyclic codes</ut>
    <ut>$\theta $-sequential codes</ut>
    <ut>skew polynomial rings</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://www.m-hikari.com/ija/ija-2011/ija-1-4-2011/index.html</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper we generalize the notion of cyclicity of codes, that is, $\theta $-polycyclic codes and $\theta $-sequential codes. It is shown that for a code $C$, $C$ is $\theta $-polycyclic ($\theta $-sequential) if and only if its dual $C^\perp $ is $\theta ^{-1}$-sequential ($\theta ^{-1}$-polycyclic). Furthermore, we study central $\theta $-constacyclic codes.</ab>
    <rv></rv>
  </abgroup>
</item>