This paper discusses the problem of decoding codeword in Reed- Muller Codes. We will use the Hadamard matrices as a method to decode codeword in Reed- Muller codes.In addition Reed- Muller Codes are defined and encoding matrices are discussed. Finally, a method of decoding is explained and an example is given to clarify this method, as well as, this method is compared with the classical method which is called Hamming distance.

Simulation experiments are a means of solving in many fields, and it is the process of designing a model of the real system in order to follow it and identify its behavior through certain models and formulas written according to a repeating software style with a number of iterations. The aim of this study is to build a model  that deals with the behavior suffering from the state of (heteroskedasticity) by studying the models (APGARCH & NAGARCH) using (Gaussian) and (Non-Gaussian) distributions for different sample sizes (500,1000,1500,2000) through the stage of time series analysis (identification , estimation, diagnostic checking and prediction). The data was generated using the estimations of the parameters resulting f

Background: It has been well known that the success of mandibular implant- retained overdenture heavily depends on initial stability, retention and long term osseointegration this is might be due to optimal stresses distribution in surrounding bones. Types of mandibular implant- retained overdenture anchorage system and number of dental implants play an important role in stresses distribution at the implant-bone interface. It is necessary to keep the stresses below the physiologic tolerance level of the bone .since. And it is difficult to measure these stresses around bone in vivo. In the present study, finite element analysis used to study the stresses distribution around dental implant supporting Mandible implant retained overdenture Mate

In this article, a numerical method integrated with statistical data simulation technique is introduced to solve a nonlinear system of ordinary differential equations with multiple random variable coefficients. The utilization of Monte Carlo simulation with central divided difference formula of finite difference (FD) method is repeated n times to simulate values of the variable coefficients as random sampling instead being limited as real values with respect to time. The mean of the n final solutions via this integrated technique, named in short as mean Monte Carlo finite difference (MMCFD) method, represents the final solution of the system. This method is proposed for the first time to calculate the numerical solution obtained fo

This study examined the phenomenon of unemployment in Iraq and the extent of the contribution of these loans granted by banks to finance small and medium enterprises in reducing their rates. The temporal boundaries of the study included the period between (2012-2018). The spatial boundaries consisted of random sampling of six Iraqi banks) Where the government banks included (Rafidain, Rasheed and industrial), private banks included (the Iraqi Islamic Bank and the Gulf Commercial Bank and the Bank of the Middle East). In order to achieve the objective of the research in the light of the hypotheses drawn up, the research divided into three topics, the first section highlighting the reality of small and medium enterprises in Iraq and the lo

      In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f