default search action
Zhiying Wang 0001
Person information
- affiliation: University of California at Irvine, Center for Pervasive Communications and Computing, USA
- affiliation (PhD 2013): California Institute of Technology, Electrical Engineering, Pasadena, USA
Other persons with the same name
- Zhiying Wang — disambiguation page
- Zhiying Wang 0002
— Anhui University of Technology, School of Management Science and Engineering,, China
- Zhiying Wang 0003 — National University of Defense Technology College of Computer, State Key Laboratory of High Performance Computing, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i24]Wenkai Zhang, Zhiying Wang:
Codes for Limited-Magnitude Probability Error in DNA Storage. CoRR abs/2405.10447 (2024) - 2023
- [j19]Weiqi Li
Storage Codes With Flexible Number of Nodes. IEEE Trans. Inf. Theory 69(1): 561-574 (2023) - 2022
- [j18]Weiqi Li
Flexible Distributed Matrix Multiplication. IEEE Trans. Inf. Theory 68(11): 7500-7514 (2022) - [c30]Peng Fei, Zhen Chen, Zhiying Wang, Syed Ali Jafar:
Communication-efficient Clock Synchronization. ICC 2022: 2592-2597 - [c29]Wenkai Zhang
Limited-Magnitude Error Correction for Probability Vectors in DNA Storage. ICC 2022: 3460-3465 - 2021
- [j17]Zhen Chen
GCSA Codes With Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication. IEEE J. Sel. Areas Inf. Theory 2(1): 306-316 (2021) - [c28]Weiqi Li, Zhen Chen, Zhiying Wang
Flexible Constructions for Distributed Matrix Multiplication. ISIT 2021: 1576-1581 - [c27]Peng Fei, Zhou Li
SEAL: Storage-efficient Causality Analysis on Enterprise Logs with Query-friendly Compression. USENIX Security Symposium 2021: 2987-3004 - [i23]Alireza Javani, Marwen Zorgui, Zhiying Wang:
Age of Information for Multiple-Source Multiple-Server Networks. CoRR abs/2106.07247 (2021) - [i22]Weiqi Li, Zhiying Wang, Taiting Lu, Hamid Jafarkhani:
Storage Codes with Flexible Number of Nodes. CoRR abs/2106.11336 (2021) - [i21]Weiqi Li, Zhen Chen, Zhiying Wang, Syed Ali Jafar, Hamid Jafarkhani:
Flexible Distributed Matrix Multiplication. CoRR abs/2107.10448 (2021) - 2020
- [j16]Weiqi Li
Repairing Reed-Solomon Codes Over GF(2ℓ). IEEE Commun. Lett. 24(1): 34-37 (2020) - [j15]Marwen Zorgui
An Outer Bound for Linear Multi-Node Exact Repair Regenerating Codes. IEEE Commun. Lett. 24(9): 1861-1864 (2020) - [j14]Zhen Chen
The Asymptotic Capacity of Private Search. IEEE Trans. Inf. Theory 66(8): 4709-4721 (2020) - [j13]Zhen Chen
The Capacity of T-Private Information Retrieval With Private Side Information. IEEE Trans. Inf. Theory 66(8): 4761-4773 (2020) - [c26]Alireza Javani, Marwen Zorgui, Zhiying Wang
On the Age of Information in Erasure Channels with Feedback. ICC 2020: 1-6 - [c25]Zhen Chen, Zhuqing Jia, Zhiying Wang
GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication. ISIT 2020: 227-232 - [c24]Alireza Javani, Marwen Zorgui, Zhiying Wang:
Age of Information in Multiple Sensing. ITA 2020: 1-10 - [i20]Zhen Chen, Zhuqing Jia, Zhiying Wang, Syed Ali Jafar:
GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication. CoRR abs/2002.07750 (2020)
2010 – 2019
- 2019
- [j12]Marwen Zorgui
Centralized Multi-Node Repair Regenerating Codes. IEEE Trans. Inf. Theory 65(7): 4180-4206 (2019) - [j11]Weiqi Li
On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes. IEEE Trans. Inf. Theory 65(9): 5484-5502 (2019) - [j10]Fan Li
Wireless MapReduce Distributed Computing. IEEE Trans. Inf. Theory 65(10): 6101-6114 (2019) - [c23]Alireza Javani, Marwen Zorgui, Zhiying Wang
Age of Information in Multiple Sensing. GLOBECOM 2019: 1-6 - [c22]Marwen Zorgui, Mohammed E. Fouda, Zhiying Wang
Non-Stationary Polar Codes for Resistive Memories. GLOBECOM 2019: 1-6 - [c21]Peng Fei, Zhiying Wang
LDPC Codes for Portable DNA Storage. ISIT 2019: 76-80 - [c20]Weiqi Li, Hoang Dau
On the I/O Costs in Repairing Short-Length Reed-Solomon Codes. ISIT 2019: 1087-1091 - [i19]Alireza Javani, Zhiying Wang:
Age of Information in Multiple Sensing of a Single Source. CoRR abs/1902.01975 (2019) - [i18]Marwen Zorgui, Mohammed E. Fouda, Zhiying Wang, Ahmed M. Eltawil, Fadi J. Kurdahi:
Non-Stationary Polar Codes for Resistive Memories. CoRR abs/1904.08966 (2019) - [i17]Alireza Javani, Marwen Zorgui, Zhiying Wang:
On the Age of Information in Erasure Channels with Feedback. CoRR abs/1911.05840 (2019) - 2018
- [j9]Vida Ravanmehr, Minji Kim
ChIPWig: a random access-enabling lossless and lossy compression method for ChIP-seq data. Bioinform. 34(6): 911-919 (2018) - [j8]Marwen Zorgui
Code constructions for multi-node exact repair in distributed storage. Sci. China Inf. Sci. 61(10): 100304:1-100304:18 (2018) - [j7]Zhiying Wang
Multi-Version Coding - An Information-Theoretic Perspective of Consistent Distributed Storage. IEEE Trans. Inf. Theory 64(6): 4540-4561 (2018) - [c19]Fan Li, Jinyuan Chen, Zhiying Wang
Wireless MapReduce Distributed Computing. ISIT 2018: 1286-1290 - [c18]Marwen Zorgui
On the Achievability Region of Regenerating Codes for Multiple Erasures. ISIT 2018: 2067-2071 - [c17]Zhen Chen, Zhiying Wang
The Asymptotic Capacity of Private Search. ISIT 2018: 2122-2126 - [i16]Zhen Chen, Zhiying Wang, Syed Ali Jafar:
The Asymptotic Capacity of Private Search. CoRR abs/1801.05768 (2018) - [i15]Marwen Zorgui, Zhiying Wang:
On the Achievability Region of Regenerating Codes for Multiple Erasures. CoRR abs/1802.00104 (2018) - [i14]Fan Li, Jinyuan Chen, Zhiying Wang:
Wireless MapReduce Distributed Computing. CoRR abs/1802.00894 (2018) - [i13]Marwen Zorgui, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zhiying Wang:
Storage-Efficient Shared Memory Emulation. CoRR abs/1803.01098 (2018) - [i12]Weiqi Li, Zhiying Wang, Hamid Jafarkhani:
A Tradeoff between the Sub-Packetization Size and the Repair Bandwidth for Reed-Solomon Codes. CoRR abs/1806.00496 (2018) - 2017
- [j6]Zhiying Wang
Optimal Rebuilding of Multiple Erasures in MDS Codes. IEEE Trans. Inf. Theory 63(2): 1084-1101 (2017) - [j5]Zhiying Wang
Switch Codes: Codes for Fully Parallel Reconstruction. IEEE Trans. Inf. Theory 63(4): 2061-2075 (2017) - [c16]Weiqi Li, Zhiying Wang
A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code. Allerton 2017: 942-949 - [c15]Nishil Talati, Zhiying Wang
Rate-compatible and high-throughput architecture designs for encoding LDPC codes. ISCAS 2017: 1-4 - [c14]Marwen Zorgui
Centralized multi-node repair for minimum storage regenerating codes. ISIT 2017: 2213-2217 - [i11]Marwen Zorgui, Zhiying Wang:
Centralized Multi-Node Repair Regenerating Codes. CoRR abs/1706.05431 (2017) - [i10]Zhen Chen, Zhiying Wang, Syed Ali Jafar:
The Capacity of Private Information Retrieval with Private Side Information. CoRR abs/1709.03022 (2017) - 2016
- [j4]Zhiying Wang
smallWig: parallel compression of RNA-seq WIG files. Bioinform. 32(2): 173-180 (2016) - [j3]Zhiying Wang
Explicit Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 62(8): 4466-4480 (2016) - [c13]Marwen Zorgui
Centralized multi-node repair in distributed storage. Allerton 2016: 617-624 - [c12]Viveck R. Cadambe
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation. PODC 2016: 305-313 - [i9]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Optimal Rebuilding of Multiple Erasures in MDS Codes. CoRR abs/1603.01213 (2016) - [i8]Viveck R. Cadambe, Zhiying Wang, Nancy A. Lynch:
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation. CoRR abs/1605.06844 (2016) - 2015
- [c11]Zhiying Wang
Optimal binary switch codes with small query size. ISIT 2015: 636-640 - [i7]Zhiying Wang, Viveck R. Cadambe:
Multi-Version Coding in Distributed Storage. CoRR abs/1506.00684 (2015) - 2014
- [j2]Itzhak Tamo, Zhiying Wang
Access Versus Bandwidth in Codes for Storage. IEEE Trans. Inf. Theory 60(4): 2028-2037 (2014) - [c10]Zhiying Wang
On multi-version coding for distributed storage. Allerton 2014: 569-575 - [c9]Zhiying Wang
Multi-version coding in distributed storage. ISIT 2014: 871-875 - [i6]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Explicit MDS Codes for Optimal Repair Bandwidth. CoRR abs/1411.6328 (2014) - 2013
- [j1]Itzhak Tamo, Zhiying Wang
Zigzag Codes: MDS Array Codes With Optimal Rebuilding. IEEE Trans. Inf. Theory 59(3): 1597-1616 (2013) - [c8]Zhiying Wang
Codes for network switches. ISIT 2013: 1057-1061 - [i5]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Access vs. Bandwidth in Codes for Storage. CoRR abs/1303.3668 (2013) - 2012
- [c7]Zhiying Wang
Long MDS codes for optimal repair bandwidth. ISIT 2012: 1182-1186 - [c6]Itzhak Tamo, Zhiying Wang
Access vs. bandwidth in codes for storage. ISIT 2012: 1187-1191 - 2011
- [c5]Zhiying Wang
On codes for optimal rebuilding access. Allerton 2011: 1374-1381 - [c4]Itzhak Tamo, Zhiying Wang
MDS array codes with optimal rebuilding. ISIT 2011: 1240-1244 - [c3]Anxiao Jiang, Hongchao Zhou, Zhiying Wang
Patterned cells for phase change memories. ISIT 2011: 2333-2337 - [i4]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
MDS Array Codes with Optimal Rebuilding. CoRR abs/1103.3737 (2011) - [i3]Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
On Codes for Optimal Rebuilding Access. CoRR abs/1107.1627 (2011) - [i2]Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Zigzag Codes: MDS Array Codes with Optimal Rebuilding. CoRR abs/1112.0371 (2011) - 2010
- [c2]Zhiying Wang
Partial rank modulation for flash memories. ISIT 2010: 864-868 - [i1]Zhiying Wang, Alexandros G. Dimakis, Jehoshua Bruck:
Rebuilding for Array Codes in Distributed Storage Systems. CoRR abs/1009.3291 (2010)
2000 – 2009
- 2009
- [c1]Jehoshua Bruck
On the capacity of bounded rank modulation for flash memories. ISIT 2009: 1234-1238
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 2024-11-19 21:44 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: