“…The available values of (a 2 e −τ −i , a 3m−τ −i ) in Eq. (19) are (1, 0), (1, 2), (0, 1) and (0, 3), then there are 4 choices for (a 2 e −τ −i , a 3m−τ −i ) in Eq. (19).…”
Section: Table 2 the Depth Of Element In D Coeffmentioning
confidence: 99%
“…(19) are (1, 0), (1, 2), (0, 1) and (0, 3), then there are 4 choices for (a 2 e −τ −i , a 3m−τ −i ) in Eq. (19). In addition, for each 2 e − i < j ≤ s − 1, there are 2 choices for a j−τ , and the available values of a j−τ are 0 and 1.…”
Section: Table 2 the Depth Of Element In D Coeffmentioning
“…The available values of (a 2 e −τ −i , a 3m−τ −i ) in Eq. (19) are (1, 0), (1, 2), (0, 1) and (0, 3), then there are 4 choices for (a 2 e −τ −i , a 3m−τ −i ) in Eq. (19).…”
Section: Table 2 the Depth Of Element In D Coeffmentioning
confidence: 99%
“…(19) are (1, 0), (1, 2), (0, 1) and (0, 3), then there are 4 choices for (a 2 e −τ −i , a 3m−τ −i ) in Eq. (19). In addition, for each 2 e − i < j ≤ s − 1, there are 2 choices for a j−τ , and the available values of a j−τ are 0 and 1.…”
Section: Table 2 the Depth Of Element In D Coeffmentioning
“…The above quotation from Massey shows that in the beginning the motivation to investigate the linear codes with a complementary dual or linear complementary dual code (LCD codes for short) is purely algebraic in general [3][4][5][6]. However, since the last five years the LCD codes become a very active research area since their application to cryptography, in particular to protect an information against so-called "side-channel attacks (SCA)" or "fault non-invasive attacks", as shown by Carlet and Guilley [7].…”
In this article, we study linear codes with complementary dual (LCD codes) over the ring, where = ; p is an odd prime, is a positive integer, and = ; which generalize the observation of Melakhessou et al. (2018). We give necessary and sufficient conditions on the existence of LCD codes and present a method of construction of LCD codes from a combinatorial object, namely from weighing matrices. Several concrete examples are also provided.
“…In [14], Dertli et al explored skew-constacyclic and skew-quasi constacyclic codes over Z 3 [v]/ v 3 − v . Recently, Shi et al, in [22], studied skew cyclic codes over F p s [v]/ v m − v , where p is a prime and m − 1 divides p − 1. The motivation for studying this ring is lying under the facts that first this ring is as a natural generalization of codes over the ring F p [v]/ v p −v .…”
Section: Introductionmentioning
confidence: 99%
“…It is easy to see that any complete set of idempotents in R q is a basis of F q -vector space. Therefore, any element r of R q can be represented as: [22]. For i = 0, 1, • • • , q − 1, we consider the map…”
In this paper, the investigation on the algebraic structure of the ringand the description of its automorphism group, enable to study the algebraic structure of codes and their dual over this ring. We explore the algebraic structure of skew-constacyclic codes, by using a linear Gray map and we determine their generator polynomials. Necessary and sufficient conditions for the existence of self-dual skew cyclic and self-dual skew negacyclic codes over Fq[v] v q −v are given.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.