In this paper we give a short overview of Symmetric key block cipher for different algorithms presented in this field according to classified it in cryptography where we classified into categories. first, Mode of operation which is ways helped to apply block cipher to encrypt larger plaintext. second, iterated product cipher which also classified it into Feistel Network, substitution-permutatio...

One of the main weakness of the family of centralizer codes is that its length is always n. Thus we have taken a new matrix equation code called intertwining code. Specialty of this code is the length of it, which is of the form nk. We establish two decoding methods which can be fitted to intertwining codes as well as for any linear codes. We also show an inclusion of linear codes into a specia...

The 3D MIMO code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that the ML decoding performance can be achieved with a complexity of O(M) instead of O(M)...

A Space-Time Block Code (STBC) in K−variables is said to be g-Group ML-Decodable (GMLD) if its MaximumLikelihood (ML) decoding metric can be written as a sum of g independent terms, with each term being a function of a subset of the K variables. In this paper, a construction method to obtain high-rate, 2-GMLD STBCs for 2m transmit antennas, m > 1, is presented. The rate of the STBC obtained for...

In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MMI) on space-time block codes that enable symbolwise maximum likelihood decoding for a frequency non-selective quasi-static fading channel. MMI is an upper bound on how much one can send information with vanishing error...

in this paper, we consider an implicit block backwarddifferentiation formula (bbdf) for solving volterraintegro-differential equations (vides). the approach given in thispaper leads to numerical methods for solving vides which avoid theneed for special starting procedures. convergence order and linearstability properties of the methods are analyzed. also, methods withextensive stability region ...