Score: 0

Skew generalized quasi-cyclic codes over non-chain ring $F_q+vF_q$

Published: April 28, 2025 | arXiv ID: 2504.19926v1

By: Kundan Suxena, Indibar Debnath, Om Prakash

Potential Business Impact:

Creates better error-correcting codes for computers.

Business Areas:
QR Codes Software

For a prime $p$, let $F_q$ be the finite field of order $q= p^d$. This paper presents the study on skew generalized quasi-cyclic (SGQC) codes of length $n$ over the non-chain ring $F_q+vF_q$ where $v^2=v$ and $\theta_t$ is the Galois automorphism. Here, first, we prove the dual of an SGQC code of length $n$ is also an SGQC code of the same length and derive a necessary and sufficient condition for the existence of a self-dual SGQC code. Then, we discuss the $1$-generator polynomial and the $\rho$-generator polynomial for skew generalized quasi-cyclic codes. Further, we determine the dimension and BCH type bound for the 1-generator skew generalized quasi-cyclic codes. As a by-product, with the help of MAGMA software, we provide a few examples of SGQC codes and obtain some $2$-generator SGQC codes of index $2$.

Country of Origin
🇮🇳 India

Page Count
24 pages

Category
Computer Science:
Information Theory