default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrick P. C. Lee
- > Home > Persons > Patrick P. C. Lee
Publications
- 2023
[j75]Hanxu Hou
, Yunghsiang S. Han, Patrick P. C. Lee, You Wu, Guojun Han, Mario Blaum:
A Generalization of Array Codes With Local Properties and Efficient Encoding/Decoding. IEEE Trans. Inf. Theory 69(1): 107-125 (2023)- 2022
- [c107]Hao Shi, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Zhengyi Jiang, Zhongyi Huang, Bo Bai:
New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node Failure. ISIT 2022: 2601-2606 - [i25]Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Bo Bai, Zhongyi Huang:
Two New Piggybacking Designs with Lower Repair Bandwidth. CoRR abs/2205.14555 (2022) - 2021
- [c98]Hanxu Hou, Patrick P. C. Lee:
Generalized Rack-aware Regenerating Codes for Jointly Optimal Node and Rack Repairs. ISIT 2021: 2191-2196 - [c97]Hanxu Hou, Patrick P. C. Lee:
STAR+ Codes: Triple-Fault-Tolerant Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding. ITW 2021: 1-6 - [i22]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, You Wu, Guojun Han, Mario Blaum:
A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding. CoRR abs/2110.04785 (2021) - 2020
- [j62]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Zigzag-Decodable Reconstruction Codes With Asymptotically Optimal Repair for All Nodes. IEEE Trans. Commun. 68(10): 5999-6011 (2020) - [j61]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee:
Two Classes of Binary MDS Array Codes With Asymptotically Optimal Repair for Any Single Column. IEEE Trans. Commun. 68(11): 6723-6736 (2020) - [j59]Hanxu Hou, Patrick P. C. Lee:
Binary MDS Array Codes With Optimal Repair. IEEE Trans. Inf. Theory 66(3): 1405-1422 (2020) - [c90]You Wu, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Guojun Han:
Generalized Expanded-Blaum-Roth Codes and Their Efficient Encoding/Decoding. GLOBECOM 2020: 1-6 - [c84]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization. ISIT 2020: 554-559 - [c83]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Toward Optimality in Both Repair and Update via Generic MDS Code Transformation. ISIT 2020: 560-565 - 2019
- [j54]Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum, Yuchong Hu:
Rack-Aware Regenerating Codes for Data Centers. IEEE Trans. Inf. Theory 65(8): 4730-4745 (2019) - [j53]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Yuchong Hu, Hui Li:
A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair. IEEE Trans. Inf. Theory 65(11): 7095-7113 (2019) - [c76]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee:
Binary MDS Array Codes with Asymptotically Optimal Repair for All Columns. ICCCN 2019: 1-9 - [c74]Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Qingfeng Zhou:
New Regenerating Codes over Binary Cyclic Codes. ISIT 2019: 216-220 - [i20]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization. CoRR abs/1907.08938 (2019) - 2018
- [j48]Hanxu Hou, Patrick P. C. Lee:
A New Construction of EVENODD Codes With Lower Computational Complexity. IEEE Commun. Lett. 22(6): 1120-1123 (2018) - [i16]Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum, Yuchong Hu:
Rack-Aware Regenerating Codes for Data Centers. CoRR abs/1802.04031 (2018) - [i15]Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee, Yuchong Hu, Hui Li:
A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair. CoRR abs/1802.07891 (2018) - [i14]Hanxu Hou, Patrick P. C. Lee:
Binary MDS Array Codes with Optimal Repair. CoRR abs/1809.04380 (2018) - 2017
- [c63]Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han, Yuchong Hu:
Triple-fault-tolerant binary MDS array codes with asymptotically optimal repair. ISIT 2017: 839-843
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-09-18 01: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
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:
