English
Related papers

Related papers: Factorizations of Cyclic Groups and Bayonet Codes

200 papers

Any power series with unit constant term can be factored into an infinite product of the form $\prod_{n\geq 1} (1-q^n)^{-a_n}$. We give direct formulas for the exponents $a_n$ in terms of the coefficients of the power series, and vice…

Combinatorics · Mathematics 2025-08-19 Robert Schneider , Andrew V. Sills , Hunter Waldron

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where…

Information Theory · Computer Science 2019-04-18 Zahid Raza , Amrina Rana

We study the equivalence of families of polycyclic codes associated with polynomials of the form $x^n - a_{n-1}x^{n-1} - \ldots - a_1x - a_0$ over a finite field. We begin with the specific case of polycyclic codes associated with a…

Information Theory · Computer Science 2026-05-26 Hassan Ou-azzou , Anna-Lena Horlemann

In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…

Rings and Algebras · Mathematics 2025-11-06 Seema Chahal , Sugandha Maheshwary

We study the rank weight hierarchy, thus in particular the rank metric, of cyclic codes over the finite field $\mathbb F_{q^m}$, $q$ a prime power, $m \geq 2$. We establish the rank weight hierarchy for $[n,n-1]$ cyclic codes and…

Information Theory · Computer Science 2014-07-16 Jérôme Ducoat , Frédérique Oggier

Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been…

Information Theory · Computer Science 2022-07-18 Xiaoqiang Wang , Chunming Tang , Cunsheng Ding

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…

Combinatorics · Mathematics 2009-02-24 Yurii Burman , Dimitri Zvonkine

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$, where $p$ is a prime number and $m$ is a positive integer. Self-dual constacyclic codes of length \( p^s \) over \( \frac{\mathbb{F}_{p^m}[u]}{\langle u^3 \rangle} \) exist only…

Information Theory · Computer Science 2025-01-10 Youssef Ahendouz , Ismail Akharraz

A finite group $G$ is called $k$-factorizable if for any factorization $|G|=a_1\cdots a_k$ with $a_i>1$ there exist subsets $A_i$ of $G$ with $|A_i|=a_i$ such that $G=A_1\cdots A_k$. We say that $G$ is \textit{multifold-factorizable} if $G$…

Group Theory · Mathematics 2024-01-18 Mikhail Kabenyuk

In a recent paper, Bilu et al. studied a conjecture of Marques and Lengyel on the $p$-adic valuation of the Tribonacci sequence. In this article, we study the $p$-adic valuation of third order linear recurrence sequences by considering a…

Number Theory · Mathematics 2024-10-17 Deepa Antony , Rupam Barman

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

Number Theory · Mathematics 2023-04-18 H. E. A. Campbell , David L. Wehlau

A cyclic codes of length $n$ over the rings $Z_{2^{m}}$ of integer of modulo $2^{m}$ is a linear code with property that if the codeword $(c_0,c_1,...,c_{n-1})\in \mathcal{C}$ then the cyclic shift $(c_1,c_2,...,c_0)\in \mathcal{C}$.…

Rings and Algebras · Mathematics 2011-12-19 Xiongqing Tan

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

Combinatorics · Mathematics 2018-11-21 Golnaz Badkobeh , Pascal Ochem

Let K/Q be a cyclic extension. In this paper, we give several congruences connecting the prime divisors of the degree g= [K:Q] with the prime divisors of the class number h of K/Q. As an exemple, the theorem: Let K/Q be a cyclic extension…

Number Theory · Mathematics 2007-05-23 Roland Queme

A family of groups is called (maximal) cyclic bounded ((M)CB) if, for every natural number $n$, there are only finitely many groups in the family with at most $n$ (maximal) cyclic subgroups. We prove that the family of groups of prime power…

Group Theory · Mathematics 2024-05-21 Xiaofang Gao , Martino Garonzi

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

Group Theory · Mathematics 2023-09-25 Oihana Garaialde Ocaña , Mima Stanojkovski

Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta x^{2^k+1}+\ga…

Information Theory · Computer Science 2009-04-16 Jinquan Luo

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Barbara Langfeld

Let $G$ be a finite group and let $A_1,\ldots,A_k$ be a collection of subsets of $G$ such that $G=A_1\ldots A_k$ is the product of all the $A_i$'s with $|G|=|A_1|\ldots|A_k|$. We write $G=A_1\cdot\ldots\cdot A_k$ and call this a $k$-fold…

Group Theory · Mathematics 2022-11-04 Mikhail Kabenyuk
‹ Prev 1 3 4 5 6 7 10 Next ›