Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Li, X., Mao, Y., Wei, M., & Li, R. (2015). Searching for (near) optimal codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9486, pp. 521–536). Springer Verlag. https://doi.org/10.1007/978-3-319-26626-8_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
