50 citations · 51 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2014★ 1 cited
Additive codes over from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao +1
In , Danielsen and Parker \cite{DP} proved that every self-dual additive code over is equivalent to a graph code. So, graph is an important tool for searching (propos…
math.CO2014
Formally self-dual linear binary codes from circulant graphs
Ruihu Li, Xueliang Li, Yaping Mao +1
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 t…