In this work, cyclic-skew-cyclic codes and sum-rank BCH are introduced. Cyclic-skew-cyclic characterized as left ideals of a suitable non-commutative finite ring, constructed using skew polynomials on top (or vice versa). Single generators such found, they used to construct generator matrices the corresponding codes. The notion defining set is introduced, pairs roots poynomials. A lower bound (...

Let p be an odd prime, where ϑ and m are positive integers. ψ a nonzero element of the finite field Fq, q=pm, R=Fq+uFq+u2Fq(u3=0). In this paper, we determine completely symbol-triple distances all ψ-constacyclic codes length pϑ over R.

let $d$ be a digraph with skew-adjacency matrix $s(d)$. then the skew energyof $d$ is defined to be the sum of the norms of all eigenvalues of $s(d)$. denote by$mathcal{o}_n$ the class of digraphs on order $n$ with no even cycles, and by$mathcal{o}_{n,m}$ the class of digraphs in $mathcal{o}_n$ with $m$ arcs.in this paper, we first give the minimal skew energy digraphs in$mathcal{o}_n$ and $mat...

In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta ]$-submodules of $R_{n}=R[x;\theta ]/\langle x^{n}-1\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an...