The Miller-Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

In this paper, we give two unexpected applications of a Hamming code. The first one, also known as the "Hat Problem," is based on the fact that a small portion of the available code words are actually used in a Hamming code. The second one is a magic trick based on the fact that a Hamming code is perfect for single-error correction.

In this work, the characteristics of a simulator for channel coding techniques used in communication systems, are described. This software has been designed for engineering students in order to facilitate the understanding of how the error correcting codes work. To help students understand easily the concepts related to these kinds of codes, a…