In this thesis we study the application of trace maps over Galois fields and Galois rings in the construction of non-binary linear and non-linear codes and mutually unbiased bases. Properties of the trace map over the Galois fields and Galois rings has been used very successfully in the construction of cocyclic Hadamard, complex Hadamard and Butson Hadamard matrices and consequently to construct linear codes over integers modulo prime and prime powers. These results provide motivation to extend this work to construct codes over integers modulo . The prime factorization of integers paved the way to focus our attention on the direct product of Galois rings and Galois fields of the same degree. We define a new map over the direct product of Galois rings and Galois fields by using the usual trace maps. We study the fundamental properties of the this map and notice that these are very similar to that of the trace map over Galois rings and Galois fields. As such this map called the trace-like map and is used to construct cocyclic Butson Hadamard matrices and consequently to construct linear codes over integers modulo . We notice that the codes construct in this way over the integers modulo 6 is simplex code of type . A further generalization of the trace-like map called the weighted-trace map is defined over the direct product of Galois rings and Galois fields of different degrees. We use the weighted-trace map to construct some non-linear codes and mutually unbiased bases of odd integer dimensions. Further more we study the distribution of over the Galois fields of degree 2 and use it to construct 2-dimensional, two-weight, self-orthogonal codes and constant weight codes over integers modulo prime.

<p>This thesis investigates architectures for multiplying elements in Galois rings of the size 4^m, where m is an integer. </p><p>The main question is whether known architectures for multiplying in Galois fields can be used for Galois rings also, with small modifications, and the answer to that question is that they can. </p><p>Different representations for elements in Galois rings are also explored, and the performance of multipliers for the different representations is investigated.</p>

This thesis investigates architectures for multiplying elements in Galois rings of the size 4^m, where m is an integer. The main question is whether known architectures for multiplying in Galois fields can be used for Galois rings also, with small modifications, and the answer to that question is that they can. Different representations for elements in Galois rings are also explored, and the performance of multipliers for the different representations is investigated.

No description available.