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.
The study aimed to prepare quick response codes to learn some of the technical skills of the second graders in the Faculty of Physical Education and Sports Sciences. The experimental method was used in the design of the experimental and control experimental and control groups. The research sample was represented by second-graders in the College of Physical Education and Sports Sciences / University of Baghdad, and by lot, the second division (a) was chosen to represent the experimental group that applied the inverse method using the QR code, and the second division (g) to represent the control group and applied the traditional method. (10) Students per group. After the tribal tests, his main experiment was carried out for 10 weeks with one
... Show MoreThe study aimed to prepare quick response codes to learn some of the technical skills of the second graders in the Faculty of Physical Education and Sports Sciences. The experimental method was used in the design of the experimental and control experimental and control groups. The research sample was represented by second-graders in the College of Physical Education and Sports Sciences / University of Baghdad, and by lot, the second division (a) was chosen to represent the experimental group that applied the inverse method using the QR code, and the second division (g) to represent the control group and applied the traditional method. (10) Students per group. After the tribal tests, his main experiment was carried out for 10 weeks with one
... Show MoreThe main objective of this paper is to find the order and its exponent, the general form of all conjugacy classes, Artin characters table and Artin exponent for the group of lower unitriangular matrices L(3,? p ), where p is prime number.
In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11), n = 2,3,…,10,11 by geometric method, with the related blocking sets and projective codes.
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.
The aim of the paper is to compute projective maximum distance separable codes, -MDS of two and three dimensions with certain lengths and Hamming weight distribution from the arcs in the projective line and plane over the finite field of order twenty-five. Also, the linear codes generated by an incidence matrix of points and lines of were studied over different finite fields.