Table of Contents
Fetching ...

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

Akanksha, Ritumoni Sarma

TL;DR

The paper addresses polycyclic codes over the product ring $\mathbb{F}_q^l$ and seeks to relate such codes to standard $\mathbb{F}_q$-linear codes via a decomposition. It proves that $\mathbb{F}_q[x]/\langle f(x)\rangle \cong \mathbb{F}_q^{l}$ if and only if $f(x)$ splits into distinct linear factors, and extends this to multivariable quotients, yielding $l=\prod_i \deg f_i$. A central methodological contribution is the $\mathbb{F}_q$-decomposition: any $\mathbb{F}_q^l$-code decomposes as $\mathcal{C}=\bigoplus_{i=1}^l \mathbf{e}_i\mathcal{C}_i$ so that properties like annihilator duality transfer componentwise, i.e., $\mathcal{C}^\circ=\bigoplus_{i=1}^l \mathbf{e}_i\mathcal{C}_i^\circ$. Using Gray maps and quasi-cyclic/quasi-sequential correspondences, the paper constructs many good codes, including MDS, LCD, and some dual-containing codes, and, via CSS, quantum codes; it thus provides a unified framework with practical coding-theoretic impact. The results highlight the broader applicability of product-ring bases beyond previously studied quotient rings and point to future work on identifying Gray maps that maximize code distance.

Abstract

In this article, for the finite field $\mathbb{F}_q$, we show that the $\mathbb{F}_q$-algebra $\mathbb{F}_q[x]/\langle f(x) \rangle$ is isomorphic to the product ring $\mathbb{F}_q^{°f(x)}$ if and only if $f(x)$ splits over $\mathbb{F}_q$ into distinct factors. We generalize this result to the quotient of the polynomial algebra $\mathbb{F}_q[x_1, x_2,\dots, x_k]$ by the ideal $\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 $\mathbb{F}_q$-algebra $\mathcal{S}$ has an orthogonal basis of idempotents with their sum equal to $1_{\mathcal{S}}$ if and only if $\mathcal{S}\cong\mathbb{F}_q^l$ as $\mathbb{F}_q$-algebras, where $l=\dim_{\mathbb{F}_q} \mathcal{S}$. Instead of studying polycyclic codes over $\mathbb{F}_q$-algebras $\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 $f_i(x_i)$ splits into distinct linear factors over $\mathbb{F}_q,$ which is a subclass of $\mathbb{F}_q^l,$ we study polycyclic codes over $\mathbb{F}_q^l$ and obtain their unique decomposition into polycyclic codes over $\mathbb{F}_q$ for every such orthogonal basis of $\mathbb{F}_q^l$. We refer to it as an $\mathbb{F}_q$-decomposition. An $\mathbb{F}_q$-decomposition enables us to use results of polycyclic codes over $\mathbb{F}_q$ to study polycyclic codes over $\mathbb{F}_q^l$; for instance, we show that the annihilator dual of a polycyclic code over $\mathbb{F}_q^l$ is a polycyclic code over $\mathbb{F}_q^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 $\mathbb{F}_q$. Finally, we study Gray maps from $(\mathbb{F}_q^l)^n$ to $\mathbb{F}_q^{nl},$ and use it to construct quantum codes with the help of CSS construction.

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

TL;DR

The paper addresses polycyclic codes over the product ring and seeks to relate such codes to standard -linear codes via a decomposition. It proves that if and only if splits into distinct linear factors, and extends this to multivariable quotients, yielding . A central methodological contribution is the -decomposition: any -code decomposes as so that properties like annihilator duality transfer componentwise, i.e., . Using Gray maps and quasi-cyclic/quasi-sequential correspondences, the paper constructs many good codes, including MDS, LCD, and some dual-containing codes, and, via CSS, quantum codes; it thus provides a unified framework with practical coding-theoretic impact. The results highlight the broader applicability of product-ring bases beyond previously studied quotient rings and point to future work on identifying Gray maps that maximize code distance.

Abstract

In this article, for the finite field , we show that the -algebra is isomorphic to the product ring if and only if splits over into distinct factors. We generalize this result to the quotient of the polynomial algebra by the ideal On the other hand, we establish that every finite-dimensional -algebra has an orthogonal basis of idempotents with their sum equal to if and only if as -algebras, where . Instead of studying polycyclic codes over -algebras where splits into distinct linear factors over which is a subclass of we study polycyclic codes over and obtain their unique decomposition into polycyclic codes over for every such orthogonal basis of . We refer to it as an -decomposition. An -decomposition enables us to use results of polycyclic codes over to study polycyclic codes over ; for instance, we show that the annihilator dual of a polycyclic code over is a polycyclic code over . 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 . Finally, we study Gray maps from to and use it to construct quantum codes with the help of CSS construction.
Paper Structure (7 sections, 37 theorems, 27 equations, 4 tables)

This paper contains 7 sections, 37 theorems, 27 equations, 4 tables.

Key Result

Proposition 2.6

lopez2009dual A linear code over $R$ is $\mathbf{a}$-polycyclic code if and only if it is an ideal of $R^\mathbf{a}$.

Theorems & Definitions (90)

  • Definition 2.1: $R$-linear Code
  • Definition 2.2: Euclidean Dual
  • Definition 2.3: LCD Codes
  • Definition 2.4
  • Definition 2.5: Polycyclic Codes
  • Proposition 2.6
  • Definition 2.7: Sequential Codes
  • Definition 2.8
  • Lemma 3.1
  • proof
  • ...and 80 more