Formally self-dual (fsd) codes are interesting codes and have received an enormous research effort due to their importance in mathematics and computer science. Danielsen and Parker proved that every self-dual additive...
详细信息
ISBN:
(纸本)9783319266268;9783319266251
Formally self-dual (fsd) codes are interesting codes and have received an enormous research effort due to their importance in mathematics and computer science. Danielsen and Parker proved that every self-dual additive code over GF(4) is equivalent to a graph codes in 2006, and hence graph is an important tool for searching (near) optimal codes. In this paper, we introduce a new method of searching (near) optimal binary (formally self-dual) linear codes and additive codes from circulant graphs.
暂无评论