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 GF4 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
