This paper presents the construction of large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight which has cut down hardware implementation cost and complexity as compared to the connection of individual columns and rows. The construction of newly obtained codes gives a class of efficiently encodable quasi-cyclic LDPC codes.

Despite the availability of an abundant literature on singularly perturbed problems, interest toward non-linear problems has been limited. In particular, parameter-uniform methods for semilinear are quasi-non-existent. this article, we study a two-dimensional convection-diffusion problems. Our approach requires linearization continuous problem using quasilinearization technique. We then discret...

The use of supervised learning techniques for fitting weights and/or generator functions of weighted quasi-arithmetic means – a special class of idempotent and nondecreasing aggregation functions – to empirical data has already been considered in a number of papers. Nevertheless, there are still some important issues that have not been discussed in the literature yet. In the first part of this ...

We propose a new method for classification of photometric factors, such as diffuse reflection, specular reflection, attached shadow, and cast shadow. For analyzing real images, we utilize the photometric linearization method which was originally proposed for image synthesis. First, we show that each pixel can be photometrically classified by the simple comparison of the pixel intensity. Our cla...