Papers
Topics
Authors
Recent
Search
2000 character limit reached

Polycyclic Codes over the Product Ring Fql\mathbb{F}_q^l and their Annihilator Dual

Published 26 Dec 2024 in cs.IT and math.IT | (2412.19126v2)

Abstract: In this article, for the finite field F<em>q\mathbb{F}<em>q, we show that the Fq\mathbb{F}_q-algebra Fq[x]/f(x)\mathbb{F}_q[x]/\langle f(x) \rangle is isomorphic to the product ring Fq<sup>deg</sup>f(x)\mathbb{F}_q<sup>{\deg</sup> f(x)} if and only if f(x)f(x) splits over Fq\mathbb{F}_q into distinct factors. We generalize this result to the quotient of the polynomial algebra Fq[x1,x2,,xk]\mathbb{F}_q[x_1, x_2,\dots, x_k] by the ideal f1(x1),f2(x2),,fk(xk).\langle f_1(x_1), f_2(x_2),\dots, f_k(x_k)\rangle. On the other hand, we establish that every finite-dimensional Fq\mathbb{F}_q-algebra S\mathcal{S} has an orthogonal basis of idempotents with their sum equal to 1</em>S1</em>{\mathcal{S}} if and only if SF<em>q<sup>l\mathcal{S}\cong\mathbb{F}<em>q<sup>l as Fq\mathbb{F}_q-algebras, where l=dim</em>FqSl=\dim</em>{\mathbb{F}_q} \mathcal{S}. Instead of studying polycyclic codes over Fq\mathbb{F}_q-algebras Fq[x1,x2,,xk]/f1(x1),f2(x2),,fk(xk)\mathbb{F}_q[x_1, x_2,\dots, x_k]/\langle f_1(x_1), f_2(x_2),\dots, f_k(x_k)\rangle where fi(xi)f_i(x_i) splits into distinct linear factors over Fq,\mathbb{F}_q, which is a subclass of Fq<sup>l,\mathbb{F}_q<sup>l, we study polycyclic codes over Fq<sup>l\mathbb{F}_q<sup>l and obtain their unique decomposition into polycyclic codes over Fq\mathbb{F}_q for every such orthogonal basis of Fq<sup>l\mathbb{F}_q<sup>l. We refer to it as an Fq\mathbb{F}_q-decomposition. An Fq\mathbb{F}_q-decomposition enables us to use results of polycyclic codes over Fq\mathbb{F}_q to study polycyclic codes over Fq<sup>l\mathbb{F}_q<sup>l; for instance, we show that the annihilator dual of a polycyclic code over Fq<sup>l\mathbb{F}_q<sup>l is a polycyclic code over Fq<sup>l\mathbb{F}_q<sup>l. 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\mathbb{F}_q. Finally, we study Gray maps from (Fq<sup>l)<sup>n(\mathbb{F}_q<sup>l)<sup>n to Fq<sup>nl,\mathbb{F}_q<sup>{nl}, and use it to construct quantum codes with the help of CSS construction.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.