SELF-DUAL CODES FROM SMALLER LENGTHS OF SELF-DUAL CODES AND RECURSIVE ALGORITHM

Self-dual codes have been received great attention by researchers since the beginning of the coding theory. In this work, some construction methods for this kind of codes are composed which produce new self-dual codes from self-dual codes of smaller lengths. A special one of these methods that is called recursive algorithm is also mentioned. For the binary case, it was shown that recursive algorithm is actually same with another so-called building-up construction method. This comparison is mentioned here.