LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Polyadic constacyclic codes over a non-chain ring $$\mathbb {F}_{q}[u,v]/\langle f(u),g(v), uv-vu\rangle $$

Photo by hollymindrup from unsplash

Let f(u) and g(v) be two polynomials, not both linear, which split into distinct linear factors over \(\mathbb {F}_{q}\). Let \(\mathcal {R}=\mathbb {F}_{q}[u,v]/ \langle f(u),g(v),uv-vu\rangle \) be a finite commutative… Click to show full abstract

Let f(u) and g(v) be two polynomials, not both linear, which split into distinct linear factors over \(\mathbb {F}_{q}\). Let \(\mathcal {R}=\mathbb {F}_{q}[u,v]/ \langle f(u),g(v),uv-vu\rangle \) be a finite commutative non-chain ring. In this paper, we study polyadic \(\lambda \)-constacyclic codes of Type I and Type II over \(\mathcal {R}\) for \(\lambda \in \mathbb {F}_q^*\). The Gray images of polyadic negacyclic codes and their extensions lead to construction of self-dual, isodual, self-orthogonal and complementary dual(LCD) codes over \(\mathbb {F}_q\). We also study \(\alpha \)-constacyclic codes over \(\mathcal {R}\) for any unit \(\alpha \) in \(\mathcal {R}\).

Keywords: non chain; langle rangle; constacyclic codes; mathbb langle; chain ring

Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.