Codes with a Certain Weight-preserving Transitive Group of Automorphisms
نویسنده
چکیده
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C.
منابع مشابه
Sporadic neighbour-transitive codes in Johnson graphs
We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least 3 which admit a neighbour-transitive group of automorphisms that is an almost simple 2-transitive group of degree v and does not occur in an infinite family of 2-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum dis...
متن کاملOn equality of absolute central and class preserving automorphisms of finite $p$-groups
Let $G$ be a finite non-abelian $p$-group and $L(G)$ denotes the absolute center of $G$. Also, let $Aut^{L}(G)$ and $Aut_c(G)$ denote the group of all absolute central and the class preserving automorphisms of $G$, respectively. In this paper, we give a necessary and sufficient condition for $G$ such that $Aut_c(G)=Aut^{L}(G)$. We also characterize all finite non-abelian $p$-groups of order $p^...
متن کاملCorrigendum Parallelisms of P G(3, 4) with Automorphisms of Order 5
A spread is a set of lines of PG(d, q), which partition the point set. A parallelism is a partition of the set of lines by spreads. Some constructions of constant dimension codes that contain lifted MRD codes are based on parallelisms of projective spaces. A parallelism is transitive if it has an automorphism group which is transitive on the spreads. A parallelism is point-transitive if it has ...
متن کاملOn Marginal Automorphisms of a Group Fixing the Certain Subgroup
Let W be a variety of groups defined by a set W of laws and G be a finite p-group in W. The automorphism α of a group G is said to bea marginal automorphism (with respect to W), if for all x ∈ G, x−1α(x) ∈ W∗(G), where W∗(G) is the marginal subgroup of G. Let M,N be two normalsubgroups of G. By AutM(G), we mean the subgroup of Aut(G) consistingof all automorphisms which centralize G/M. AutN(G) ...
متن کاملCompletely Transitive Codes in Hamming Graphs
A code in a graph 0 is a non-empty subset C of the vertex set V of 0. Given C , the partition of V according to the distance of the vertices away from C is called the distance partition of C . A completely regular code is a code whose distance partition has a certain regularity property. A special class of completely regular codes are the completely transitive codes. These are completely regula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 39 شماره
صفحات -
تاریخ انتشار 2006