Jianfa Qian

Orcid: 0000-0003-4823-8539

According to our database1, Jianfa Qian authored at least 12 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
New Optimal Cyclic Locally Recoverable Codes of Length n=2(q+1).
IEEE Trans. Inf. Theory, 2020

2019
Constructions of new entanglement-assisted quantum MDS and almost MDS codes.
Quantum Inf. Process., 2019

Improved Constructions for Optimal Multi-erasure Locally Recoverable Codes for Big Data Storage.
Proceedings of the 2nd International Conference on Big Data Technologies, 2019

2018
On MDS linear complementary dual codes and entanglement-assisted quantum codes.
Des. Codes Cryptogr., 2018

2017
Improved constructions for quantum maximum distance separable codes.
Quantum Inf. Process., 2017

2015
Entanglement-assisted quantum codes from arbitrary binary linear codes.
Des. Codes Cryptogr., 2015

2013
New optimal subsystem codes.
Discret. Math., 2013

2012
Secret Sharing Schemes from Linear Codes over Finite Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

2008
On the Gray Image of Cyclic Codes over Finite Chain Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

2006
Constacyclic and Cyclic Codes over <i>F</i><sub>2</sub> + <i>uF</i><sub>2</sub> + <i>u</i><sup>2</sup><i>F</i><sub>2</sub>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

(1+<i>u</i>) constacyclic and cyclic codes over <i>F</i><sub>2</sub>+<i>u</i><i>F</i><sub>2</sub>.
Appl. Math. Lett., 2006

2005
Cyclic Codes over F<sub>p</sub> + uF<sub>p</sub>+ ··· +u<sup>k-1</sup> F<sub>p</sub>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005


  Loading...