The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
On self-dual codes over some prime fields
Discrete Mathematics
On circulant self-dual codes over small fields
Designs, Codes and Cryptography
Experimental constructions of self-dual codes
Finite Fields and Their Applications
Hi-index | 0.00 |
In this paper, two general methods for constructing self-dual codes are presented. These methods use circulant matrices in circulant or bordered circulant structures to construct the suitable generator matrices. The necessary and sufficient conditions, for the generated codes to be self-dual, are provided. Special cases of the proposed methods include the well known "Pure Double Circulant" construction and the "Bordered Double circulant" construction of self-dual codes. As an example, the methods were applied to search for self-dual codes in GF(5). Many new inequivalent self-dual codes with best known distance are found.