Learn More
Generalized quasi-cyclic (GQC) codes are defined by generator matrices comprised of circulant matrices of lengths not necessarily identical. A decomposition of these codes is given by using the Chinese reminder theorem. The focus is to characterize ρ-generator GQC codes in details. A good lower bound on the minimum distance of such a code in terms of the(More)
In this paper, a dynamic clustering for saving energy for wireless sensor network suggested. Our goal is to decrease the probability of missing the target and to increase the tracking exactness. First phase is consisting of selecting cluster head and creating clusters. In the next phase, new creating cluster based on moving targets. So that cluster head(More)
  • 1