Permutation group of the 𝑞-ary image of some 𝑞^{𝑚}-ary cyclic codes

1999 ◽  
pp. 165-176 ◽  
Author(s):  
Jérôme Lacan ◽  
Emmanuelle Delpeyroux
Keyword(s):  
Permutation Group ◽  
Cyclic Codes

The complements in an affine group

2013 ◽  
Vol 50 (2) ◽  
pp. 258-265
Author(s):  
Pál Hegedűs
Keyword(s):  
Permutation Group ◽  
Structural Similarity ◽  
Affine Group ◽  
Permutation Module ◽  
Regular Module ◽  
Brauer Characters

In this paper we analyse the natural permutation module of an affine permutation group. For this the regular module of an elementary Abelian p-group is described in detail. We consider the inequivalent permutation modules coming from nonconjugate complements. We prove their strong structural similarity well exceeding the fact that they have equal Brauer characters.

A Large Class of p-Ary Cyclic Codes and Sequence Families

2010 ◽  
Vol E93-A (11) ◽  
pp. 2272-2277
Author(s):  
Zhengchun ZHOU ◽  
Xiaohu TANG ◽  
Udaya PARAMPALLI
Keyword(s):  
Large Class ◽  
Cyclic Codes

A Family of q-Ary Cyclic Codes with Optimal Parameters

2020 ◽  
Vol E103.A (3) ◽  
pp. 631-633
Author(s):  
Wenhua ZHANG ◽  
Shidong ZHANG ◽  
Yong WANG ◽  
Jianpeng WANG
Keyword(s):  
Cyclic Codes ◽  
Optimal Parameters

A class of constacyclic codes over the ring Z4[u,v]/ and their Gray images

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash
Keyword(s):  
Cyclic Codes ◽  
Constacyclic Codes ◽  
Gray Maps ◽  
Permutation Equivalent ◽  
Quasi Cyclic Codes

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.

scholarly journals ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA
Keyword(s):  
Permutation Group ◽  
Model Theory ◽  
Independent Set ◽  
Maximum Size ◽  
Proper Subset ◽  
Permutation Groups ◽  
Finite Permutation Group ◽  
Pointwise Stabilizer ◽  
Relational Complexity

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).

Some generalized characters associated to a transitive permutation group

2020 ◽  
Vol 23 (3) ◽  
pp. 393-397
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Necessary Condition ◽  
Transitive Permutation Group ◽  
Point Stabilizer ◽  
Necessary And Sufficient ◽  
Regular Character ◽  
Permutation Character

AbstractLet G be a finite transitive permutation group of degree n, with point stabilizer {H\neq 1} and permutation character π. For every positive integer t, we consider the generalized character {\psi_{t}=\rho_{G}-t(\pi-1_{G})}, where {\rho_{G}} is the regular character of G and {1_{G}} the 1-character. We give necessary and sufficient conditions on t (and G) which guarantee that {\psi_{t}} is a character of G. A necessary condition is that {t\leq\min\{n-1,\lvert H\rvert\}}, and it turns out that {\psi_{t}} is a character of G for {t=n-1} resp. {t=\lvert H\rvert} precisely when G is 2-transitive resp. a Frobenius group.

Sign in / Sign up

Export Citation Format

Share Document