The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.

In this paper, a new third kind Chebyshev wavelets operational matrix of derivative is presented, then the operational matrix of derivative is applied for solving optimal control problems using, third kind Chebyshev wavelets expansions. The proposed method consists of reducing the linear system of optimal control problem into a system of algebraic equations, by expanding the state variables, as a series in terms of third kind Chebyshev wavelets with unknown coefficients. Example to illustrate the effectiveness of the method has been presented.

Periodontitis is a chronic inflammatory disease resulted from aggravated immune response to a dysbiotic subgingival microbiota of a susceptible host. Consequences of periodontitis are not only limited to the devastating effect on the oral cavity but extends to affect general health of the individual and also exerts economic burdens on the health systems worldwide. Despite these serious outcomes of periodontitis; however, they are avoidable by early diagnosis with proper preventive measures or non-invasive interventions at earlier stages of the disease. Clinically, diagnosis of periodontitis could be overlooked due to certain limitations of the conventional diagnostic methods such as periodontal charting and radiographs. Utilization of re

For many problems in Physics and Computational Fluid Dynamics (CFD), providing an accurate approximation of derivatives is a challenging task. This paper presents a class of high order numerical schemes for approximating the first derivative. These approximations are derived based on solving a special system of equations with some unknown coefficients. The construction method provides numerous types of schemes with different orders of accuracy. The accuracy of each scheme is analyzed by using Fourier analysis, which illustrates the dispersion and dissipation of the scheme. The polynomial technique is used to verify the order of accuracy of the proposed schemes by obtaining the error terms. Dispersion and dissipation errors are calculated

Stone Matrix Asphalt (SMA) is a gap-graded asphalt concrete hot blend combining high-quality coarse aggregate with a rich asphalt cement content. This blend generates a stable paving combination with a powerful stone-on-stone skeleton that offers excellent durability and routing strength. The objectives of this work are: Studying the durability performance of stone matrix asphalt (SMA) mixture in terms of moisture damage and temperature susceptibility and Discovering the effect of stabilized additive (Fly Ash ) on the performance of stone matrix asphalt (SMA) mixture. In this investigation, the durability of stone matrix asphalt concrete was assessed in terms of temperature susceptibility, resistance to moisture damage, and sensitivity t

Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand