![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Weijun Fang
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Weijun Fang
, Jiejing Wen, Fang-Wei Fu:
Quantum MDS codes with new length and large minimum distance. Discret. Math. 347(1): 113662 (2024) - [j19]Weijun Fang
, Jingjie Lv
, Bin Chen
, Shu-Tao Xia
, Xiangyu Chen
:
New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes. IEEE Trans. Inf. Theory 70(3): 1806-1822 (2024) - [j18]Jing Qiu
, Weijun Fang, Fang-Wei Fu:
New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes. IEEE Trans. Inf. Theory 70(7): 4968-4982 (2024) - [i15]Weijun Fang, Jingke Xu, Ruiqi Zhu:
Deep Holes of Twisted Reed-Solomon Codes. CoRR abs/2403.11436 (2024) - 2023
- [j17]Ziteng Huang, Weijun Fang, Fang-Wei Fu, Fengting Li:
Generic constructions of MDS Euclidean self-dual codes via GRS codes. Adv. Math. Commun. 17(6): 1453-1467 (2023) - [j16]Weijun Fang
, Bin Chen, Shu-Tao Xia, Fang-Wei Fu, Xiangyu Chen:
Perfect LRCs and k-optimal LRCs. Des. Codes Cryptogr. 91(4): 1209-1232 (2023) - [j15]Weijun Fang
, Fang-Wei Fu, Bin Chen, Shu-Tao Xia:
Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes. Finite Fields Their Appl. 91: 102273 (2023) - [j14]Jingjie Lv
, Weijun Fang
, Xiangyu Chen
, Jing Yang
, Shu-Tao Xia
:
New Constructions of q-Ary MDS Array Codes With Multiple Parities and Their Effective Decoding. IEEE Trans. Inf. Theory 69(11): 7082-7098 (2023) - [c11]Jingjie Lv, Weijun Fang, Bin Chen, Shu-Tao Xia, Xiangyu Chen:
Binary MDS Array Codes with Flexible Array Dimensions and Their Fast Encoding. ISIT 2023: 1249-1254 - [c10]Dong Wang, Weijun Fang, Sihuang Hu:
Optimal (2, δ) Locally Repairable Codes via Punctured Simplex Codes. ISIT 2023: 1747-1752 - [i14]Weijun Fang, Fang-Wei Fu, Bin Chen, Shu-Tao Xia:
Singleton-Optimal LRCs and Perfect LRCs via Cyclic and Constacyclic Codes. CoRR abs/2303.06287 (2023) - [i13]Dong Wang, Weijun Fang, Sihuang Hu:
Optimal (2, δ) Locally Repairable Codes via Punctured Simplex Codes. CoRR abs/2307.04323 (2023) - [i12]Jing Qiu, Weijun Fang, Fang-Wei Fu:
New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes. CoRR abs/2310.07524 (2023) - 2022
- [j13]Weijun Fang, Jun Zhang
, Shu-Tao Xia, Fang-Wei Fu:
New constructions of self-dual generalized Reed-Solomon codes. Cryptogr. Commun. 14(3): 677-690 (2022) - [j12]Ziteng Huang, Weijun Fang
, Fang-Wei Fu:
Linear ℓ-intersection pairs of MDS codes and their applications to AEAQECCs. Cryptogr. Commun. 14(5): 1189-1206 (2022) - [c9]Bin Chen, Weijun Fang, Yueqi Chen, Shu-Tao Xia, Fang-Wei Fu, Xiangyu Chen:
Some Results on the Improved Bound and Construction of Optimal $(r, \ \delta)$ LRCs. ICCC 2022: 365-370 - [c8]Jingjie Lv, Weijun Fang, Bin Chen, Shu-Tao Xia, Xiangyu Chen:
New constructions of binary MDS array codes and locally repairable array codes. ISIT 2022: 2184-2189 - [c7]Jing Qiu, Weijun Fang, Fang-Wei Fu:
Optimal and Almost Optimal Cyclic (r, δ)-LRCs With Large Code Lengths. ISIT 2022: 3126-3131 - [c6]Xue Yang, Yan Feng, Weijun Fang, Jun Shao, Xiaohu Tang, Shu-Tao Xia, Rongxing Lu:
An Accuracy-Lossless Perturbation Method for Defending Privacy Attacks in Federated Learning. WWW 2022: 732-742 - [i11]Bin Chen, Weijun Fang, Yueqi Chen, Shu-Tao Xia, Fang-Wei Fu, Xiangyu Chen:
Some Results on the Improved Bound and Construction of Optimal (r, δ) LRCs. CoRR abs/2202.03301 (2022) - [i10]Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Bounds and Constructions of Singleton-Optimal Locally Repairable Codes with Small Localities. CoRR abs/2207.05479 (2022) - 2021
- [j11]Bin Chen
, Weijun Fang
, Shu-Tao Xia
, Jie Hao
, Fang-Wei Fu
:
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6. IEEE Trans. Inf. Theory 67(1): 217-231 (2021) - [j10]Weijun Fang
, Shu-Tao Xia
, Fang-Wei Fu
:
Construction of MDS Euclidean Self-Dual Codes via Two Subsets. IEEE Trans. Inf. Theory 67(8): 5005-5015 (2021) - [c5]Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Singleton-Optimal LRCs and Perfect LRCs via Cyclic Codes. ISIT 2021: 3261-3266 - [i9]Ziteng Huang, Weijun Fang, Fang-Wei Fu:
New constructions of MDS self-dual and self-orthogonal codes via GRS codes. CoRR abs/2103.11665 (2021) - [i8]Ziteng Huang, Weijun Fang, Fang-Wei Fu:
On pure MDS asymmetric entanglement-assisted quantum error-correcting codes. CoRR abs/2107.04166 (2021) - 2020
- [j9]Yun Gao
, Weijun Fang, Fang-Wei Fu:
On the algebraic structure of quasi-cyclic codes of index $1\frac {1}{2}$. Cryptogr. Commun. 12(1): 1-18 (2020) - [j8]Weijun Fang, Fang-Wei Fu:
Optimal cyclic (r, δ) locally repairable codes with unbounded length. Finite Fields Their Appl. 63: 101650 (2020) - [j7]Weijun Fang
, Fang-Wei Fu
, Lanqiang Li
, Shixin Zhu
:
Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs. IEEE Trans. Inf. Theory 66(6): 3527-3537 (2020) - [c4]Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions. ISIT 2020: 595-599 - [c3]Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Perfect LRCs and k-Optimal LRCs. ISIT 2020: 600-604 - [i7]Yan Feng, Xue Yang, Weijun Fang, Shu-Tao Xia, Xiaohu Tang:
Practical and Bilateral Privacy-preserving Federated Learning. CoRR abs/2002.09843 (2020) - [i6]Weijun Fang, Jun Zhang, Shu-Tao Xia, Fang-Wei Fu:
A Note on Self-Dual Generalized Reed-Solomon Codes. CoRR abs/2005.11732 (2020) - [i5]Weijun Fang, Shu-Tao Xia, Fang-Wei Fu:
Construction of MDS Euclidean Self-Dual Codes via Two Subsets. CoRR abs/2006.00457 (2020)
2010 – 2019
- 2019
- [j6]Bin Chen
, Weijun Fang
, Shu-Tao Xia
, Fang-Wei Fu
:
Constructions of Optimal $(r, \delta)$ Locally Repairable Codes via Constacyclic Codes. IEEE Trans. Commun. 67(8): 5253-5263 (2019) - [j5]Weijun Fang
, Fang-Wei Fu
:
New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes. IEEE Trans. Inf. Theory 65(9): 5574-5579 (2019) - [j4]Weijun Fang
, Fang-Wei Fu
:
Some New Constructions of Quantum MDS Codes. IEEE Trans. Inf. Theory 65(12): 7840-7847 (2019) - 2018
- [j3]Weijun Fang, Fang-Wei Fu:
Two new classes of quantum MDS codes. Finite Fields Their Appl. 53: 85-98 (2018) - [j2]Weijun Fang, Li-Ping Wang, Daqing Wan:
On deep holes of Gabidulin codes. Finite Fields Their Appl. 54: 216-229 (2018) - [c2]Weijun Fang, Fang-Wei Fu:
Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length. ITW 2018: 1-5 - [c1]Weijun Fang, Fang-Wei Fu, Bin Chen, Shu-Tao Xia:
On Optimal (r, δ)-LRCs with Length n | (q+1). ITW 2018: 1-5 - [i4]Weijun Fang, Fang-Wei Fu:
Two new classes of quantum MDS codes. CoRR abs/1803.06602 (2018) - [i3]Weijun Fang, Fang-Wei Fu:
Some New Constructions of Quantum MDS Codes. CoRR abs/1804.08213 (2018) - [i2]Weijun Fang, Fang-Wei Fu:
Optimal cyclic (r, δ) locally repairable codes with unbounded length. CoRR abs/1805.12345 (2018) - 2017
- [j1]Weijun Fang, Jiejing Wen, Fang-Wei Fu:
A q-polynomial approach to constacyclic codes. Finite Fields Their Appl. 47: 161-182 (2017) - [i1]Weijun Fang, Li-Ping Wang, Daqing Wan:
On deep-holes of Gabidulin codes. CoRR abs/1711.11202 (2017)
Coauthor Index
aka: Shu-Tao Xia
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-01 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint