Quasi-polycyclic (QP for short) codes over a finite chain ring R are generalization of quasi-cyclic codes, and these can be viewed as an R[x]-submodule $${\mathcal {R}}_m^{\ell }$$ , where {R}}_m:= R[x]/\langle f\rangle $$ f is monic polynomial degree m R. If factors uniquely into coprime basic irreducibles, then their algebraic structure allow us to characterize the generator polynomials minim...

For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g ∈ Fq and h ∈ 〈g〉, an integer x such that gx = h. We present an algorithm for computing discrete logarithms with which we prove that for each prime p there exist infinitely many explicit extension fields Fpn in which the DLP can be solved in expected quasi-polynomial time. Furthermore, subject to a con...

The cardinality of the minimal generating set of a module M i.e g(M) plays a very important role in the study of QTAG-Modules. Fuchs [1] mentioned the importance of upper and lower basic subgroups of primary groups. A need was felt to generalize these concepts for modules. An upper basic submodule B of a QTAG-Module M reveals much more information about the structure of M . We find that each ba...

primary-like and weakly primary-like submodules are two new generalizations of primary ideals from rings to modules. in fact, the class of primary-like submodules of a module lie between primary submodules and weakly primary-like submodules properly.  in this note, we show that these three classes coincide when their elements are submodules of a multiplication module and satisfy the primeful pr...

‎Let $G$ be a group with identity $e.$ Let $R$ be a $G$-graded‎ ‎commutative ring and $M$ a graded $R$-module‎. ‎In this paper‎, ‎we‎ ‎introduce several results concerning graded classical prime‎ ‎submodules‎. ‎For example‎, ‎we give a characterization of graded‎ ‎classical prime submodules‎. ‎Also‎, ‎the relations between graded‎ ‎classical prime and graded prime submodules of $M$ are studied‎.‎

‎s‎. ‎kim et al‎. ‎have been analyzed the girth of some algebraically‎ ‎structured quasi-cyclic (qc) low-density parity-check (ldpc)‎ ‎codes‎, ‎i.e‎. ‎tanner $(3,5)$ of length $5p$‎, ‎where $p$ is a prime of‎ ‎the form $15m+1$‎. ‎in this paper‎, ‎by extension this method to‎ ‎tanner $(3,7)$ codes of length $7p$‎, ‎where $p$ is a prime of the‎ ‎form $21m‎+ ‎1$‎, ‎the girth values of tanner $(3,7...

An automorphism of a graph is called quasi-semiregular if it fixes unique vertex the and its remaining cycles have same length. This kind symmetry graphs was first investigated by Kutnar, Malnič, Martínez Marušič in 2013, as generalization well-known problem regarding existence semiregular automorphisms vertex-transitive graphs. Symmetric valency three or four, admitting automorphism, been clas...

The notion of the square submodule of a module M over an arbitrary commutative ring R, which is denoted by RM, was introduced by Aghdam and Najafizadeh in [3]. In fact, RM is the R−submodule of M generated by the images of all bilinear maps on M. Furthermore, given a submodule N of an R−module M, we say that M is nil modulo N if μ(M×M) ≤ N for all bilinear maps μ on M. The main question about t...

Suppose that is an innnite set and k is a natural number. Let ] k denote the set of all k-subsets of and let F be a eld. In this paper we study the FSym(()-submodule structure of the permutation module F] k. Using the representation theory of nite symmetric groups, we show that every submodule of F] k can be written as an intersection of kernels of certain FSym(()-homomorphisms F] k ?! F] l for...