http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
SKEW CONSTACYCLIC CODES OVER FINITE COMMUTATIVE SEMI-SIMPLE RINGS
Dinh, Hai Q.,Nguyen, Bac Trong,Sriboonchitta, Songsak Korean Mathematical Society 2019 대한수학회보 Vol.56 No.2
This paper investigates skew ${\Theta}-{\lambda}$-constacyclic codes over $R=F_0{\oplus}F_1{\oplus}{\cdots}{\oplus}F_{k-1}$, where $F{_i}^{\prime}s$ are finite fields. The structures of skew ${\lambda}$-constacyclic codes over finite commutative semi-simple rings and their duals are provided. Moreover, skew ${\lambda}$-constacyclic codes of arbitrary length are studied under a new definition. We also show that a skew cyclic code of arbitrary length over finite commutative semi-simple rings is equivalent to either a cyclic code over R or a quasi-cyclic code over R.
Skew constacyclic codes over finite commutative semi-simple rings
Hai Q. Dinh,Bac Trong Nguyen,Songsak Sriboonchitta 대한수학회 2019 대한수학회보 Vol.56 No.2
This paper investigates skew $\Theta$-$\lambda$-constacyclic codes over $R={\bf F}_0\oplus {\bf F}_1 \oplus \cdots \oplus {\bf F}_{k-1}$, where ${\bf F}_i$'s are finite fields. The structures of skew $\lambda$-constacyclic codes over finite commutative semi-simple rings and their duals are provided. Moreover, skew $\lambda$-constacyclic codes of arbitrary length are studied under a new definition. We also show that a skew cyclic code of arbitrary length over finite commutative semi-simple rings is equivalent to either a cyclic code over $R$ or a quasi-cyclic code over $R$.