In this paper, we propose a construction method of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes. The shift offset values of the circulant permutation submatrices are selected not only by maximising the girth but also by maximising the minimum distance upper bound. The proposed method provides a more rational optimisation way than only maximising the girth. Copyright © 2012 Jo...

We use several main-sequence models to derive distances (and extinctions), with statistically meaningful uncertainties for 11 star-forming-regions and young clusters. The model dependency is shown to be small, allowing us to adopt the distances derived using one model. Using these distances we have revised the age order for some of the clusters of Mayne et al. (2007). The new nominal ages are: ...

An improved algorithm, together with its implementation, is presented for the automatic computation of the complete root classification of a real parametric polynomial. The algorithm offers improved efficiency and a new test for non-realizable conditions. The improvement lies in the direct use of ‘sign lists’, obtained from the discriminant sequence, rather than ‘revised sign lists’. It is show...

Abst rac t . A universal description method of sign language is the most fundamental requirement in sign language research. Although a number of methods including notations have been invented, few are in substantial use for describing general sign languages. In this paper, we present structural description method of hand configuration based on human hand structure and geometric sign features, a...

An intuitionistic fuzzy set (IFS) can be helpful in decision-making as a concept to describe uncertainty. This study proposes the application of IFS determining research topics for students mathematics education program using normalized Euclidean distance method. also shows differences analysis results max-min composition method revised by De et al. (2001) with Hamming and The show that determi...

0

Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use diierent representations of distance vectors as input. We study the optimality of each with respect to the dependence analysis it uses....