Construction of quasi-cyclic self-dual codes

There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field ${\mathbb{F}}_q$ and linear codes over a ring $R={\mathbb{F}}_q[Y]/(Y^m?1)$. Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field ${\mathbb{F}}_q$ can be obtained by the building-up construction, provided that $\mathrm{char}({\mathbb{F}}_q)=2$ or $q\equiv 1(\mathrm{mod}4)$, m is a prime p, and q is a primitive element of ${\mathbb{F}}_p$. We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths $30,36,42,48$ (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When $m=5$, we obtain a new 8-quasi-cyclic self-dual $[40,20,12]$ code over ${\mathbb{F}}_3$ and a new 6-quasi-cyclic self-dual $[30,15,10]$ code over ${\mathbb{F}}_4$. When $m=7$, we find a new 4-quasi-cyclic self-dual $[28,14,9]$ code over ${\mathbb{F}}_4$ and a new 6-quasi-cyclic self-dual $[42,21,12]$ code over ${\mathbb{F}}_4$.     

A class of minimal cyclic codes over finite fields

Let ${\mathbb{F}}_q$ be a finite field of odd order $q$ and $n=2^a{p}_1^{a_1}{p}_2^{a_2}$, where $a,a_1,a_2$ are positive integers, $p_1,p_2$ are distinct odd primes and $4p_1{p}_2|q?1$. In this paper, we study the irreducible factorization of $x^n?1$ over ${\mathbb{F}}_q$ and all primitive idempotents in the ring ${\mathbb{F}}_q\left[x\right]∕〈x^n?1〉$.Moreover, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length $n$ over ${\mathbb{F}}_q$.     

Domination and upper domination of direct product graphs

Let $X_{\mathbb{Z}∕n\mathbb{Z}}$ denote the unitary Cayley graph of $\mathbb{Z}∕n\mathbb{Z}$. We present results on the tightness of the known inequality $\gamma \left(X_{\mathbb{Z}∕n\mathbb{Z}}\right)\le {\gamma }_t\left(X_{\mathbb{Z}∕n\mathbb{Z}}\right)\le g\left(n\right)$, where $\gamma$ and${\gamma }_t$ denote the domination number and total domination number, respectively, and $g$ is the arithmetic function known as Jacobsthal’s function. In particular, we construct integers $n$ with arbitrarily many distinct prime factors such that $\gamma \left(X_{\mathbb{Z}∕n\mathbb{Z}}\right)\le {\gamma }_t\left(X_{\mathbb{Z}∕n\mathbb{Z}}\right)\le g\left(n\right)?1$. We give lower bounds for the domination numbers of direct products of complete graphs and present a conjecture for the exact values of the upper domination numbers of direct products of balanced, complete multipartite graphs.