Abstract:The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic codes with very long lengths and special generator polynomials to those with prime lengths. Consequently, we mainly determine the permutation groups of certain cyclic codes over $\mathbb{F}_{r^\alpha}$ with lengths $hp$, $r^mp^n$ and $pq$ and special generator polynomials where $h$ is a positive integer and $p$, $q$ and $r$ are distinct prime numbers. For length $pq$, we manage to provide the permutation groups of cyclic codes with generator polynomials $Q_{pq}(x)$(the $pq$-th cyclotomic polynomial) or others, which seems to be the first work about permutation groups of cyclic codes with generator polynomials that are factors of $x^{pq}-1$ but not factors of $x^p-1(\text{or }x^q-1)$.
| Subjects: | Information Theory (cs.IT) |
| Cite as: | arXiv:2605.24314 [cs.IT] |
| (or arXiv:2605.24314v1 [cs.IT] for this version) | |
| https://doi.org/10.48550/arXiv.2605.24314 arXiv-issued DOI via DataCite (pending registration) |
From: Chang-An Zhao [view email]
[v1]
Sat, 23 May 2026 00:43:24 UTC (15 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。