default search action
Jie Hao 0001
Person information
- affiliation: Beijing University of Posts and Telecommunications, Information Security Center, China
- affiliation (PhD 2017): Tsinghua University, Beijing, China
Other persons with the same name
- Jie Hao — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Jie Hao
, Shu-Tao Xia, Kenneth W. Shum, Bin Chen, Fang-Wei Fu, Yixian Yang:
Optimal ternary locally repairable codes. Des. Codes Cryptogr. 92(9): 2685-2704 (2024) - [c17]Zhisheng Zhang
Mitigating Unauthorized Speech Synthesis for Voice Protection. LAMPS@CCS 2024: 13-24 - [c16]Weifei Jin
Towards Evaluating the Robustness of Automatic Speech Recognition Systems via Audio Style Transfer. SecTL@AsiaCCS 2024: 47-55 - [i7]Weifei Jin, Yuxin Cao, Junjie Su, Qi Shen, Kai Ye, Derui Wang, Jie Hao, Ziyao Liu:
Towards Evaluating the Robustness of Automatic Speech Recognition Systems via Audio Style Transfer. CoRR abs/2405.09470 (2024) - [i6]Zhisheng Zhang, Qianyi Yang, Derui Wang, Pengyang Huang, Yuxin Cao, Kai Ye, Jie Hao:
Mitigating Unauthorized Speech Synthesis for Voice Protection. CoRR abs/2410.20742 (2024) - 2022
- [j8]Jie Hao
Constructions and Weight Distributions of Optimal Locally Repairable Codes. IEEE Trans. Commun. 70(5): 2895-2908 (2022) - 2021
- [j7]Bin Chen
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) - [c15]Jie Hao, Kenneth W. Shum, Shu-Tao Xia, Fang-Wei Fu, Yixian Yang:
On Optimal Quaternary Locally Repairable Codes. ISIT 2021: 3267-3272 - 2020
- [j6]Jie Hao
Optimal Locally Repairable Codes for Parallel Reading. IEEE Access 8: 80447-80453 (2020) - [j5]Jie Hao
On the Generalized Hamming Weights of (r, δ)-Locally Repairable Codes. IEEE Access 8: 149706-149713 (2020) - [j4]Jie Hao
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach. IEEE Trans. Inf. Theory 66(12): 7465-7474 (2020) - [c14]Jie Hao, Jun Zhang, Shu-Tao Xia, Fang-Wei Fu, Yi-Xian Yang:
Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension. ISIT 2020: 611-615
2010 – 2019
- 2019
- [c13]Bin Chen, Shu-Tao Xia, Jie Hao:
Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6. ISIT 2019: 2823-2827 - [c12]Jie Hao, Kenneth W. Shum, Shu-Tao Xia, Yi-Xian Yang:
Classification of Optimal Ternary (r, δ)-Locally Repairable Codes Attaining the Singleton-like Bound. ISIT 2019: 2828-2832 - 2018
- [j3]Bin Chen
Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes. IEEE Trans. Inf. Theory 64(4): 2499-2511 (2018) - [c11]Bin Chen, Shu-Tao Xia, Jie Hao, Fang-Wei Fu:
On Optimal Pseudo-cyclic ($r, \delta$) Locally Repairable Codes. ISIT 2018: 1191-1195 - [c10]Jie Hao, Yi-Xian Yang, Kenneth W. Shum, Shu-Tao Xia:
On the Maximal Code Length of Optimal Linear Locally Repairable Codes. ISIT 2018: 1326-1330 - 2017
- [j2]Yanbo Lu, Jie Hao, Shu-Tao Xia:
On the Single-Parity Locally Repairable Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(6): 1342-1345 (2017) - [c9]Jie Hao, Shu-Tao Xia, Bin Chen:
On the linear codes with (r, δ)-locality for distributed storage. ICC 2017: 1-6 - [c8]Jie Hao, Shu-Tao Xia, Bin Chen:
On optimal ternary locally repairable codes. ISIT 2017: 171-175 - [c7]Bin Chen, Shu-Tao Xia, Jie Hao:
Locally repairable codes with multiple (ri, δi)-localities. ISIT 2017: 2038-2042 - [c6]Jie Hao, Shu-Tao Xia, Bin Chen, Fang-Wei Fu:
On the weight hierarchy of locally repairable codes. ITW 2017: 31-35 - [i5]Jie Hao, Shu-Tao Xia, Bin Chen:
On Optimal Ternary Locally Repairable Codes. CoRR abs/1702.05730 (2017) - [i4]Bin Chen, Shu-Tao Xia, Jie Hao:
Locally Repairable Codes with Multiple (ri, δi)-Localities. CoRR abs/1702.05741 (2017) - [i3]Jie Hao, Shu-Tao Xia, Bin Chen, Fang-Wei Fu:
On the Weight Hierarchy of Locally Repairable Codes. CoRR abs/1702.05848 (2017) - 2016
- [j1]Jie Hao, Shu-Tao Xia:
Constructions of Optimal Binary Locally Repairable Codes With Multiple Repair Groups. IEEE Commun. Lett. 20(6): 1060-1063 (2016) - [c5]Jie Hao, Shu-Tao Xia, Bin Chen:
On the single-parity locally repairable codes with availability. ICCC 2016: 1-4 - [c4]Jie Hao, Shu-Tao Xia, Bin Chen:
Some results on optimal locally repairable codes. ISIT 2016: 440-444 - [c3]Jie Hao, Shu-Tao Xia, Bin Chen:
Recursive bounds for locally repairable codes with multiple repair groups. ISIT 2016: 645-649 - [i2]Jie Hao, Shu-Tao Xia:
Bounds and Constructions of Locally Repairable Codes: Parity-check Matrix Approach. CoRR abs/1601.05595 (2016) - [i1]Bin Chen, Shu-Tao Xia, Jie Hao, Fang-Wei Fu:
Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes. CoRR abs/1609.01136 (2016) - 2015
- [c2]Yanbo Lu, Jie Hao, Xin-Ji Liu, Shu-Tao Xia:
Analysis of Repair Cost in Distributed Storage Systems with Fault-Tolerant Coding Strategies. ICA3PP (4) 2015: 358-371 - [c1]Yanbo Lu, Jie Hao, Xin-Ji Liu, Shu-Tao Xia:
Network coding for data-retrieving in cloud storage systems. NetCod 2015: 51-55
Coauthor Index
aka: Shu-Tao Xia
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-12-01 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: