Combinatorial designs and codes over some prime fields

Combinatorial designs are widely used in the construction of self-dual codes. Recently new methods for constructing self-dual codes are established using orthogonal designs, generalized orthogonal designs and Diophantine equations over GF(p). These methods have led to the construction of many new self-dual codes over small finite fields and rings. In this paper, we propose some methods to generate self-dual codes, over GF(p). Moreover, we apply shortening and padding to obtain self-orthogonal codes over GF(p), for some primes p.