Zhiying Wang

Orcid: 0000-0003-3339-3085

Affiliations:
  • University of California at Irvine, Center for Pervasive Communications and Computing, USA
  • California Institute of Technology, Electrical Engineering, Pasadena, USA (PhD 2013)


According to our database1, Zhiying Wang authored at least 52 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Codes for Limited-Magnitude Probability Error in DNA Storage.
CoRR, 2024

2023
Storage Codes With Flexible Number of Nodes.
IEEE Trans. Inf. Theory, 2023

2022
Flexible Distributed Matrix Multiplication.
IEEE Trans. Inf. Theory, 2022

Limited-Magnitude Error Correction for Probability Vectors in DNA Storage.
Proceedings of the IEEE International Conference on Communications, 2022

Communication-efficient Clock Synchronization.
Proceedings of the IEEE International Conference on Communications, 2022

2021
GCSA Codes With Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication.
IEEE J. Sel. Areas Inf. Theory, 2021

Age of Information for Multiple-Source Multiple-Server Networks.
CoRR, 2021

SEAL: Storage-efficient Causality Analysis on Enterprise Logs with Query-friendly Compression.
Proceedings of the 30th USENIX Security Symposium, 2021

Flexible Constructions for Distributed Matrix Multiplication.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
The Capacity of T-Private Information Retrieval With Private Side Information.
IEEE Trans. Inf. Theory, 2020

The Asymptotic Capacity of Private Search.
IEEE Trans. Inf. Theory, 2020

An Outer Bound for Linear Multi-Node Exact Repair Regenerating Codes.
IEEE Commun. Lett., 2020

Repairing Reed-Solomon Codes Over GF(2<sup>ℓ</sup>).
IEEE Commun. Lett., 2020

On the Age of Information in Erasure Channels with Feedback.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019
Centralized Multi-Node Repair Regenerating Codes.
IEEE Trans. Inf. Theory, 2019

On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2019

Wireless MapReduce Distributed Computing.
IEEE Trans. Inf. Theory, 2019

Age of Information in Multiple Sensing of a Single Source.
CoRR, 2019

On the I/O Costs in Repairing Short-Length Reed-Solomon Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

LDPC Codes for Portable DNA Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Non-Stationary Polar Codes for Resistive Memories.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

Age of Information in Multiple Sensing.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018
Multi-Version Coding - An Information-Theoretic Perspective of Consistent Distributed Storage.
IEEE Trans. Inf. Theory, 2018

A Tradeoff between the Sub-Packetization Size and the Repair Bandwidth for Reed-Solomon Codes.
CoRR, 2018

Storage-Efficient Shared Memory Emulation.
CoRR, 2018

Code constructions for multi-node exact repair in distributed storage.
Sci. China Inf. Sci., 2018

ChIPWig: a random access-enabling lossless and lossy compression method for ChIP-seq data.
Bioinform., 2018

On the Achievability Region of Regenerating Codes for Multiple Erasures.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Optimal Rebuilding of Multiple Erasures in MDS Codes.
IEEE Trans. Inf. Theory, 2017

Switch Codes: Codes for Fully Parallel Reconstruction.
IEEE Trans. Inf. Theory, 2017

The Capacity of Private Information Retrieval with Private Side Information.
CoRR, 2017

Centralized multi-node repair for minimum storage regenerating codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Rate-compatible and high-throughput architecture designs for encoding LDPC codes.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2017

A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Explicit Minimum Storage Regenerating Codes.
IEEE Trans. Inf. Theory, 2016

smallWig: parallel compression of RNA-seq WIG files.
Bioinform., 2016

Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Centralized multi-node repair in distributed storage.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Optimal binary switch codes with small query size.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Access Versus Bandwidth in Codes for Storage.
IEEE Trans. Inf. Theory, 2014

Explicit MDS Codes for Optimal Repair Bandwidth.
CoRR, 2014

Multi-version coding in distributed storage.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Zigzag Codes: MDS Array Codes With Optimal Rebuilding.
IEEE Trans. Inf. Theory, 2013

Codes for network switches.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Long MDS codes for optimal repair bandwidth.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Access vs. bandwidth in codes for storage.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
MDS array codes with optimal rebuilding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Patterned cells for phase change memories.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On codes for optimal rebuilding access.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Rebuilding for Array Codes in Distributed Storage Systems
CoRR, 2010

Partial rank modulation for flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
On the capacity of bounded rank modulation for flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2009


  Loading...