English
Related papers

Related papers: On metacyclic p-group codes

200 papers

In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of a finite group $G$. We compute $\eta (G)$ for all metacyclic $p$-groups. We show that if $G$ is a metacyclic $p$-group of order $p^n$ that…

Group Theory · Mathematics 2022-06-10 M. Bianchi , R. D. Camina , Mark L. Lewis

In this paper, a family of six-weight cyclic codes over GF(p) whose duals have two zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.

Number Theory · Mathematics 2013-12-18 Yan Liu , Haode Yan , Chunlei Liu

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

Group Theory · Mathematics 2012-11-08 László Tóth

Let p be an odd prime, F the field of p elements and G a finite abelian p-group with an arbitrary involutory automorphism. Extend this automorphism to the group algebra FG and consider the unitary and the symmetric normalized units of FG.…

Group Theory · Mathematics 2007-05-23 A. Bovdi , A. Szakacs

We prove that the only primes which may divide the order of the automorphism group of a putative binary self-dual doubly-even [120, 60, 24] code are 2, 3, 5, 7, 19, 23 and 29. Furthermore we prove that automorphisms of prime order $p \geq…

Information Theory · Computer Science 2013-02-04 J. de la Cruz

Let $m$, $k$ be positive integers such that $\frac{m}{\gcd(m,k)}\geq 3$, $p$ be an odd prime and $\pi $ be a primitive element of $\mathbb{F}_{p^m}$. Let $h_1(x)$ and $h_2(x)$ be the minimal polynomials of $-\pi^{-1}$ and…

Information Theory · Computer Science 2014-07-09 Long Yu , Hongwei Liu

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a class of three-weight…

Information Theory · Computer Science 2013-02-05 Zhengchun Zhou , Cunsheng Ding

We show that if two division $p$-algebras of prime degree share an inseparable field extension of the center then they also share a cyclic separable one. We show that the converse is in general not true. We also point out that sharing all…

Rings and Algebras · Mathematics 2015-03-10 Adam Chapman

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several…

Information Theory · Computer Science 2022-07-06 Zhonghua Sun , Xiaoqiang Wang , Cunsheng Ding

Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…

Representation Theory · Mathematics 2014-01-10 Gabriela Olteanu , Inneke Van Gelder

In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…

Information Theory · Computer Science 2023-01-02 Gülsüm Gözde Yılmazgüç , Javier de la Cruz , Edgar Martínez-Moro

For any $m \ge 1$ and odd prime power $\mathtt{q}=\mathtt{p}^m$, for $\mathtt{q}=2$, and for any $n \ge 1$, we show a result of decomposition for Pauli groups $\mathcal{P}_{n,\mathtt{q}}$ in terms of weak central products. This can be used…

Group Theory · Mathematics 2020-09-09 Andrea Rocchetto , Francesco G. Russo

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Information Theory · Computer Science 2012-07-16 Kenza Guenda , T. Aaron Gulliver

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

Combinatorics · Mathematics 2018-10-04 Li Cui , Jin-Xin Zhou

Let p be an odd prime number. We describe the Whitehead group of all extra-special and almost extra-special p-groups. For this we compute, for any finite p-group P , the subgroup Cl\_1 (ZP) of SK\_1 (ZP), in terms of a genetic basis of P.…

Group Theory · Mathematics 2018-03-19 Serge Bouc , Nadia Romero

In this paper we explicitly determine all indicators for groups isomorphic to the semidirect product of two cyclic groups by an automorphism of prime order, as well as the generalized quaternion groups. We then compute the indicators for…

Representation Theory · Mathematics 2010-04-13 Marc Keilberg

Presentations for the holomorphs of abelian groups of the form $C_{p^n} \times 1^{m}$ for $p$=2 or an odd prime are given. These presentations extend the results given in Burnside's well-known text on finite groups on the holomorphs for the…

Group Theory · Mathematics 2007-05-23 Walter Becker

Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…

Information Theory · Computer Science 2022-08-29 Zhonghua Sun , Cunsheng Ding , Xiaoqiang Wang

A group is said to be capable if it is the central factor of some group. In this paper, among other results we have characterized capable groups of order $p^2q$, for any distinct primes $p, q$, which extends Theorem 1.2 of S. Rashid, N. H.…

Group Theory · Mathematics 2020-01-28 Sekhar Jyoti Baishya

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

Data Structures and Algorithms · Computer Science 2008-08-26 Gregory Karagiorgos , Dimitrios Poulakis