Polyadic cyclic codes over a non-chain ring \mathbbF_q[u,v]/⟨ f(u),g(v), uv-vu⟩

2018/11/05 by Goyal, Mokshi, Raka, Madhu
#11T71 #94B15 #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1811.01583

Abstract

Let f(u) and g(v) be any two polynomials of degree k and ℓ respectively (k and ℓ are not both 1), which split into distinct linear factors over \mathbbF_q. Let R=\mathbbF_q[u,v]/⟨ f(u),g(v),uv-vu⟩ be a finite commutative non-chain ring. In this paper, we study polyadic codes and their extensions over the ring R. We give examples of some polyadic codes which are optimal with respect to Griesmer type bound for rings. A Gray map is defined from Rⁿ → \mathbbF^{kℓ n}_q which preserves duality. The Gray images of polyadic codes and their extensions over the ring R lead to construction of self-dual, isodual, self-orthogonal and complementary dual (LCD) codes over \mathbbF_q. Some examples are also given to illustrate this.

Related

• Duadic negacyclic codes over a finite non-chain ring and their Gray images
• Cyclic codes over a non-chain ring R_e,q and their application to LCD codes
• Quadratic residue codes over the ring \mathbbF_p[u]/⟨ u^m-u⟩ and their Gray images
• Structure of linear codes over the ring B_k
• Polycyclic codes over serial rings and their annihilator CSS construction