Formally self-dual linear binary codes from circulant graphs
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesbinarygraphslinearcirculantformallyoptimumsearching
read the original abstract
In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.