In modules there is a relation between supplemented and Ï€-projective semimodules. This relation was introduced, explained and investigated by many authors. This research will firstly introduce a concept of "supplement subsemimodule" analogues to the case in modules: a subsemimodule Y of a semimodule W is said to be supplement of  a subsemimodule X if it is minimal with the property X+Y=W. A subsemimodule Y is called a supplement subsemimodule if it is a supplement of some subsemimodule of W. Then, the concept of supplemented semimodule will be defined as follows: an S-semimodule W is said to be supplemented if every subsemimodule of W is a supplemen

In this paper we study the concepts of δ-small M-projective module and δ-small M-pseudo projective Modules as a generalization of M-projective module and M-Pseudo Projective respectively and give some results.

In this paper we study the concepts of δ-small M-projective module and δ-small M-pseudo projective Modules as a generalization of M-projective module and M-Pseudo Projective respectively and give some results.

In projective plane over a finite field q F , a conic is the unique complete
(q 1) arc and any arcs on a conic are incomplete arc of degree less than q 1.
These arcs correspond to sets in the projective line over the same field. In this paper,
The number of inequivalent incomplete k  arcs; k  5,6, ,12, on the conic in
PG(2,23) and stabilizer group types are found. Also, the projective line
PG(1,23) has been splitting into two 12-sets and partitioned into six disjoint
tetrads.

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.

     The goal of this paper is to construct the linear code, and its dual which corresponding to classification of  projective line PG(1,31), we will present Some important results of coding theory, the generator matrix of every linear code in PG(1,31) is found,  A parity check  matrix is  also found . The mathematical programming language GAP was a main computing tool .

Acceptable Bit Error rate can be maintained by adapting some of the design parameters such as modulation, symbol rate, constellation size, and transmit power according to the channel state.

An estimate of HF propagation effects can be used to design an adaptive data transmission system over HF link. The proposed system combines the well known Automatic Link Establishment (ALE) together with variable rate transmission system. The standard ALE is modified to suite the required goal of selecting the best carrier frequency (channel) for a given transmission. This is based on measuring SINAD (Signal plus Noise plus Distortion to Noise plus Distortion), RSL (Received Signal Level), multipath phase distortion and BER (Bit Error Rate) fo

This paper describes a number of new interleaving strategies based on the golden section. The new interleavers are called golden relative prime interleavers, golden interleavers, and dithered golden interleavers. The latter two approaches involve sorting a real-valued vector derived from the golden section. Random and so-called “spread” interleavers are also considered. Turbo-code performance results are presented and compared for the various interleaving strategies. Of the interleavers considered, the dithered golden interleaver typically provides the best performance, especially for low code rates and large block sizes. The golden relative prime interleaver is shown to work surprisingly well for high puncture rates. These interleav

The aim of this paper is to construct cyclic subgroups of the projective general linear group over  from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of  into disjoint lines is discussed.