IEEE Transactions on Information Theory
Orthogonal Designs and Type II Codes over \Bbb{Z}_{2k}
Designs, Codes and Cryptography
On self-dual codes over some prime fields
Discrete Mathematics
Self-dual codes over Fp and weighing matrices
IEEE Transactions on Information Theory
MDS Self-Dual Codes over Large Prime Fields
Finite Fields and Their Applications
| Hi-index | 0.00 |
Combinatorial designs have been widely used, in the construction of self-dual codes. Recently, new methods of constructing self-dual codes are established using orthogonal designs (ODs), generalized orthogonal designs (GODs), a set of four sequences and Diophantine equations over GF(p). These methods had led to the construction of many new self-dual codes over small finite fields and rings. In this paper, we used some methods to construct self-orthogonal and self dual codes over GF(p), for some primes p. The construction is achieved by using some special kinds of combinatorial designs like orthogonal designs and GODs. Moreover, we combine eight circulant matrices, a system of Diophantine equations over GF(p), and a recently discovered array to obtain a new construction method. Using this method new self-dual and self-orthogonal codes are obtained. Specifically, we obtain new self-dual codes [32,16,12] over GF(11) and GF(13) which improve the previously known distances.