default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhengrui Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Zhengrui Li
, Wai Ho Mow, Yunghsiang S. Han, Ting-Yi Wu:
Generalization of Minimum Storage Regenerating Codes for Heterogeneous Distributed Storage Systems. IEEE Trans. Inf. Theory 70(6): 4022-4043 (2024)- 2023
- [j3]Leilei Yu, Sian-Jheng Lin, Hanxu Hou, Zhengrui Li:
Reed-Solomon Coding Algorithms Based on Reed-Muller Transform for Any Number of Parities. IEEE Trans. Computers 72(9): 2677-2688 (2023) - [c7]Na Wang, Zhengrui Li, Sian-Jheng Lin:
A Parallel ANS Coder with Reduced Decoding Error Diffusion. DCC 2023: 130-139 - [c6]Zhengrui Li, Wai Ho Mow, Yunghsiang S. Han, Ting-Yi Wu:
Cache-Aided Distributed Storage Systems. ISIT 2023: 436-441 - 2022
- [j2]Zhengrui Li, Weiwei Lin, James Z. Wang, Peng Peng, Jianpeng Lin, Victor Chang, Jianghu Pan:
A Novel Interpretable Stock Selection Algorithm for Quantitative Trading. Int. J. Grid High Perform. Comput. 14(1): 1-19 (2022) - [c5]Zhengrui Li, Wai Ho Mow, Lei Deng, Ting-Yi Wu:
Optimal-Repair-Cost MDS Array Codes for a Class of Heterogeneous Distributed Storage Systems. ISIT 2022: 2379-2384 - 2021
- [j1]Zhengrui Li, Sian-Jheng Lin, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou:
Update Bandwidth for Distributed Storage. IEEE Trans. Inf. Theory 67(11): 7159-7179 (2021) - [c4]Zhengrui Li, Yunghsiang S. Han, Ting-Yi Wu, Hanxu Hou, Bo Bai, Gong Zhang:
On the Repair Bandwidth and Repair Access of Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems. ITW 2021: 1-6 - [c3]Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li, Bo Bai, Gong Zhang, Xiaoyang Zhang, Xiang Wu:
Achievable Lower Bound on the Optimal Access Bandwidth of (K + 2, K, 2)-MDS Array Code with Degraded Read Friendly. ITW 2021: 1-5 - [i3]Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li, Bo Bai, Gong Zhang, Liang Chen, Xiang Wu:
Lower Bound on the Optimal Access Bandwidth of (K+2, K, 2)-MDS Array Code with Degraded Read Friendly. CoRR abs/2102.02436 (2021) - 2020
- [c2]Zhengrui Li, Sian-Jheng Lin, Yunghsiang S. Han:
On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes. ISIT 2020: 2831-2836 - [i2]Zhengrui Li, Sian-Jheng Lin, Po-Ning Chen, Yunghsiang S. Han, Hanxu Hou:
Update Bandwidth for Distributed Storage. CoRR abs/2005.11894 (2020)
2010 – 2019
- 2019
- [c1]Zhengrui Li, Sian-Jheng Lin:
Update Bandwidth for Distributed Storage. ISIT 2019: 1577-1581 - 2018
- [i1]Zhengrui Li, Sian-Jheng Lin, Honggang Hu:
On the Arithmetic Complexities of Hamming Codes and Hadamard Codes. CoRR abs/1804.09903 (2018)
Coauthor Index
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 2025-01-07 01: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:
