Weijun Fang

Orcid: 0000-0003-4121-290X

According to our database¹, Weijun Fang authored at least 42 papers between 2017 and 2024.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Bounds and Constructions of Singleton-Optimal Locally Repairable Codes With Small Localities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, October, 2024

New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes.

[BibT_eX]

[DOI]

Jing Qiu

Weijun Fang

Fang-Wei Fu

IEEE Trans. Inf. Theory, July, 2024

Quantum MDS codes with new length and large minimum distance.

[BibT_eX]

[DOI]

Weijun Fang

Jiejing Wen

Fang-Wei Fu

Discret. Math., January, 2024

New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2024

Deep Holes of Twisted Reed-Solomon Codes.

[BibT_eX]

[DOI]

Weijun Fang

Jingke Xu

Ruiqi Zhu

CoRR, 2024

An Explicit Construction of $q\text{-ary}$ MDS Array Codes and Their Efficient Decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Deep Holes of Twisted Reed-Solomon Codes.

[BibT_eX]

[DOI]

Weijun Fang

Jingke Xu

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

New Constructions of q-Ary MDS Array Codes With Multiple Parities and Their Effective Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, November, 2023

Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., October, 2023

Perfect LRCs and k-optimal LRCs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., April, 2023

Generic constructions of MDS Euclidean self-dual codes via GRS codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Optimal (2, δ) Locally Repairable Codes via Punctured Simplex Codes.

[BibT_eX]

[DOI]

Dong Wang

Weijun Fang

Sihuang Hu

Proceedings of the IEEE International Symposium on Information Theory, 2023

Binary MDS Array Codes with Flexible Array Dimensions and Their Fast Encoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Bounds and Constructions of Singleton-Optimal Locally Repairable Codes with Small Localities.

[BibT_eX]

[DOI]

CoRR, 2022

Some Results on the Improved Bound and Construction of Optimal (r, δ) LRCs.

[BibT_eX]

[DOI]

CoRR, 2022

Linear ℓ-intersection pairs of MDS codes and their applications to AEAQECCs.

[BibT_eX]

[DOI]

Ziteng Huang

Weijun Fang

Fang-Wei Fu

Cryptogr. Commun., 2022

New constructions of self-dual generalized Reed-Solomon codes.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2022

An Accuracy-Lossless Perturbation Method for Defending Privacy Attacks in Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Optimal and Almost Optimal Cyclic (r, δ)-LRCs With Large Code Lengths.

[BibT_eX]

[DOI]

Jing Qiu

Weijun Fang

Fang-Wei Fu

Proceedings of the IEEE International Symposium on Information Theory, 2022

New constructions of binary MDS array codes and locally repairable array codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Some Results on the Improved Bound and Construction of Optimal $(r, \ \delta)$ LRCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE/CIC International Conference on Communications in China, 2022

2021

Construction of MDS Euclidean Self-Dual Codes via Two Subsets.

[BibT_eX]

[DOI]

Weijun Fang

Shu-Tao Xia

Fang-Wei Fu

IEEE Trans. Inf. Theory, 2021

Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On pure MDS asymmetric entanglement-assisted quantum error-correcting codes.

[BibT_eX]

[DOI]

Ziteng Huang

Weijun Fang

Fang-Wei Fu

CoRR, 2021

New constructions of MDS self-dual and self-orthogonal codes via GRS codes.

[BibT_eX]

[DOI]

Ziteng Huang

Weijun Fang

Fang-Wei Fu

CoRR, 2021

Singleton-Optimal LRCs and Perfect LRCs via Cyclic Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Optimal cyclic (<i>r</i>, <i>δ</i>) locally repairable codes with unbounded length.

[BibT_eX]

[DOI]

Weijun Fang

Fang-Wei Fu

Finite Fields Their Appl., 2020

A Note on Self-Dual Generalized Reed-Solomon Codes.

[BibT_eX]

[DOI]

CoRR, 2020

Practical and Bilateral Privacy-preserving Federated Learning.

[BibT_eX]

[DOI]

CoRR, 2020

On the algebraic structure of quasi-cyclic codes of index $1\frac {1}{2}$.

[BibT_eX]

[DOI]

Yun Gao

Weijun Fang

Fang-Wei Fu

Cryptogr. Commun., 2020

Perfect LRCs and k-Optimal LRCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Some New Constructions of Quantum MDS Codes.

[BibT_eX]

[DOI]

Weijun Fang

Fang-Wei Fu

IEEE Trans. Inf. Theory, 2019

New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes.

[BibT_eX]

[DOI]

Weijun Fang

Fang-Wei Fu

IEEE Trans. Inf. Theory, 2019

Constructions of Optimal $(r, \delta)$ Locally Repairable Codes via Constacyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

2018

On deep holes of Gabidulin codes.

[BibT_eX]

[DOI]

Weijun Fang

Li-Ping Wang

Daqing Wan

Finite Fields Their Appl., 2018

Two new classes of quantum MDS codes.

[BibT_eX]

[DOI]

Weijun Fang

Fang-Wei Fu

Finite Fields Their Appl., 2018

Optimal cyclic (r, δ) locally repairable codes with unbounded length.

[BibT_eX]

[DOI]

Weijun Fang

Fang-Wei Fu

CoRR, 2018

On Optimal (r, δ)-LRCs with Length n | (q+1).

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length.

[BibT_eX]

[DOI]

Weijun Fang

Fang-Wei Fu

Proceedings of the IEEE Information Theory Workshop, 2018

2017

A q-polynomial approach to constacyclic codes.

[BibT_eX]

[DOI]

Weijun Fang

Jiejing Wen

Fang-Wei Fu

Finite Fields Their Appl., 2017

Weijun Fang

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...