Polycyclic Codes over the Product Ring Fql and their Annihilator Dual

Abstract

In this article, for the finite field Fq, we show that the Fq-algebra Fq[x]/ f(x) is isomorphic to the product ring Fq f(x) if and only if f(x) splits over Fq into distinct factors. We generalize this result to the quotient of the polynomial algebra Fq[x1, x2,…, xk] by the ideal f1(x1), f2(x2),…, fk(xk). On the other hand, we establish that every finite-dimensional Fq-algebra S has an orthogonal basis of idempotents with their sum equal to 1S if and only if Sql as Fq-algebras, where l=Fq S. Instead of studying polycyclic codes over Fq-algebras Fq[x1, x2,…, xk]/ f1(x1), f2(x2),…, fk(xk) where fi(xi) splits into distinct linear factors over Fq, which is a subclass of Fql, we study polycyclic codes over Fql and obtain their unique decomposition into polycyclic codes over Fq for every such orthogonal basis of Fql. We refer to it as an Fq-decomposition. An Fq-decomposition enables us to use results of polycyclic codes over Fq to study polycyclic codes over Fql; for instance, we show that the annihilator dual of a polycyclic code over Fql is a polycyclic code over Fql. Furthermore, with the help of different Gray maps, we produce a good number of examples of MDS or almost-MDS or/and optimal codes; some of them are LCD over Fq. Finally, we study Gray maps from (Fql)n to Fqnl, and use it to construct quantum codes with the help of CSS construction.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…