2000 character limit reached
Formally self-dual linear binary codes from circulant graphs
Published 26 Feb 2014 in math.CO, cs.IT, and math.IT | (1402.6399v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
