Despite significant research on state-space reductions, the poor scalability of model checking for reasoning about behavioral models of large, complex systems remains the chief obstacle to its broad acceptance. One strategy for making further progress is to exploit characteristics of classes of systems to develop domain-specific reductions. In this paper, we identify a structural property of sy...

In this paper, we define quasi-cyclic(QC) generalized Hadamard matrices and balanced QC generalized Hadamard matrices. Then we propose a new construction method for QC generalized Hadamard matrices. The proposed matrices are constructed from the balanced optimal low correlation zone(LCZ) sequence set which has correlation value −1 within low correlation zone.

The main goal of this paper is to introduce a new class in the category modules. It called quasi-invertibility monoform (briefly QI-monoform) This modules generalization Various properties and another characterization QI-monoform are investigated. So, we prove that an R-module M if only for each non-zero homomorphism f:M E(M), kernel not quasi-invertible submodule M. Moreover, cases under which...

let $r$ be an arbitrary ring and $t$ be a submodule of an $r$-module $m$. a submodule $n$ of $m$ is called $t$-small in $m$ provided for each submodule $x$ of $m$, $tsubseteq x+n$ implies that $tsubseteq x$. we study this mentioned notion which is a generalization of the small submodules and we obtain some related results.

Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeratio...

LCD codes are linear codes that intersect with their dual trivially. Quasi-cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are introduced to that end and their cyclic subclass is characterized. Constructions of QCCD codes from codes over larger alphabets are given.

Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings.

In a distributed storage environment, where the data is placed in nodes connected through a network, it is likely that one of these nodes fails. It is known that the use of erasure coding improves the fault tolerance and minimizes the redundancy added in distributed storage environments. The use of regenerating codes not only make the most of the erasure coding improvements, but also minimizes ...

Algebraic structure of codes over Fq , closed under arbitrary abelian group G of permutations with exponent relatively prime to q, called G-invariant codes, is investigated using a transform domain approach. In particular, this general approach unveils algebraic structure of quasicyclic codes, abelian codes, cyclic codes, and quasi-abelian codes with restriction on G to appropriate special case...

This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining (near-)optimal degree distributions for LDPC code ensembles. We also demonstrate the simplicity of representing codes by protographs and how this naturally leads to quasi-cyclic LDPC codes. The EXIT chart technique is then ex...