English
Related papers

Related papers: The permutation automorphism groups of irreducible…

200 papers

Let $p$ be an odd prime and let $B$ be a $p$-block of a finite group which has cyclic defect groups. We show that all exceptional characters in $B$ have the same Frobenius-Schur indicators. Moreover the common indicator can be computed,…

Group Theory · Mathematics 2019-01-21 John Murray

Let $f(x)\in {\mathbb Z}[x]$ be an $N$th degree polynomial that is monic and irreducible over ${\mathbb Q}$. We say that $f(x)$ is {\em monogenic} if $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of…

Number Theory · Mathematics 2025-05-15 Joshua Harrington , Lenny Jones

In this paper skew constacyclic codes over finite non-chain ring R = F_q+uF_q+vF_q, where q= p^m, p is an odd prime and u^{2}=u, v^{2}=v, uv = vu = 0 are studied. We show that Gray image of a skew alpha-constacyclic cyclic code of length n…

Information Theory · Computer Science 2017-12-11 Habibul Islam , Om Prakash

We introduce a class of cycles, called nondegenerate, strictly decomposable cycles, and show that the image of each cycle in this class under the refined cycle map to an extension group in the derived category of arithmetic mixed Hodge…

Algebraic Geometry · Mathematics 2007-05-23 Andreas Rosenschon , Morihiko Saito

Let $R=\mathbb{Z}_4$ be the integer ring mod $4$. A double cyclic code of length $(r,s)$ over $R$ is a set that can be partitioned into two parts that any cyclic shift of the coordinates of both parts leaves invariant the code. These codes…

Information Theory · Computer Science 2015-01-08 Jian Gao , Minjia Shi , Tingting Wu , Fang-Wei Fu

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

Number Theory · Mathematics 2021-03-22 Anna Chlopecki , Juliano Levier-Gomes , Wayne Peng , Alex Shearer , Adam Towsley

We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering…

Information Theory · Computer Science 2017-03-03 Ronen Karni , Moshe Schwartz

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic…

Quantum Physics · Physics 2023-08-01 Renyu Wang , Hsiang-Ku Lin , Leonid P. Pryadko

A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex…

Quantum Physics · Physics 2017-07-04 Yingkai Ouyang

We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].

Discrete Mathematics · Computer Science 2016-08-22 Emmanuel Jeandel

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

Dynamical Systems · Mathematics 2014-03-04 Van Cyr , Bryna Kra

This paper defines cyclic and minimal derivative descendants (DDs) of an extended cyclic code from the derivative of the Mattson-Solomon polynomials, respectively. First, it demonstrates that the cyclic DDs are the same extended cyclic…

Information Theory · Computer Science 2022-12-12 Bin Zhang , Qin Huang

We classify the finite primitive permutation groups which have a cyclic subgroup with two orbits. This extends classical topics in permutation group theory, and has arithmetic consequences. By a theorem of C. L. Siegel, affine algebraic…

Group Theory · Mathematics 2007-05-23 Peter Mueller

A long standing problem in the area of error correcting codes asks whether there exist good cyclic codes. Most of the known results point in the direction of a negative answer. The uncertainty principle is a classical result of harmonic…

Information Theory · Computer Science 2017-04-19 Shai Evra , Emmanuel Kowalski , Alexander Lubotzky

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Information Theory · Computer Science 2017-10-16 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

Combinatorics · Mathematics 2025-04-22 Parveen Parveen , Bikash Bhattacharjya

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

Information Theory · Computer Science 2007-08-13 Heide Gluesing-Luerssen , Fai-Lung Tsang

In this paper, necessary and sufficient conditions for the reversibility of a cyclic code of arbitrary length over a finite commutative chain ring have been derived. MDS reversible cyclic codes having length p^s over a finite chain ring…

Information Theory · Computer Science 2023-07-25 Monika Dalal , Sucheta Dutt , Ranjeet Sehmi