Ruihu Li

most citedOn

[[n, n - 4, 3]]_{q}

Quantum MDS Codes for odd prime power

q

50 citations · 51 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2014★ 1 cited

Additive codes over $GF (4)$ from circulant graphs

Ruihu Li, Xueliang Li, Yaping Mao +1

In $2006$ , Danielsen and Parker \cite{DP} proved that every self-dual additive code over $GF (4)$ 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…

cs.IT2009★ 50 cited

On $[[n, n - 4, 3]]_{q}$ Quantum MDS Codes for odd prime power $q$

Ruihu Li, Zongben Xu

For each odd prime power $q$ , let $4 \leq n \leq q^{2} + 1$ . Hermitian self-orthogonal $[n, 2, n - 1]$ codes over $GF (q^{2})$ with dual distance three are constructed by using finite fiel…

Additive codes over GF(4) from circulant graphs

Formally self-dual linear binary codes from circulant graphs

On [[n,n−4,3]]q​ Quantum MDS Codes for odd prime power q

Additive codes over $GF (4)$ from circulant graphs

On $[[n, n - 4, 3]]_{q}$ Quantum MDS Codes for odd prime power $q$