Zhiying Wang

CoRR, 2024

2023

Storage Codes With Flexible Number of Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2023

2022

Flexible Distributed Matrix Multiplication.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Limited-Magnitude Error Correction for Probability Vectors in DNA Storage.

[BibT_eX]

[DOI]

Wenkai Zhang

Proceedings of the IEEE International Conference on Communications, 2022

Communication-efficient Clock Synchronization.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2022

2021

GCSA Codes With Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Age of Information for Multiple-Source Multiple-Server Networks.

[BibT_eX]

[DOI]

CoRR, 2021

SEAL: Storage-efficient Causality Analysis on Enterprise Logs with Query-friendly Compression.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

Flexible Constructions for Distributed Matrix Multiplication.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

The Capacity of T-Private Information Retrieval With Private Side Information.

[BibT_eX]

[DOI]

Syed Ali Jafar

IEEE Trans. Inf. Theory, 2020

The Asymptotic Capacity of Private Search.

[BibT_eX]

[DOI]

Syed Ali Jafar

IEEE Trans. Inf. Theory, 2020

An Outer Bound for Linear Multi-Node Exact Repair Regenerating Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2020

Repairing Reed-Solomon Codes Over GF(2<sup>ℓ</sup>).

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2020

On the Age of Information in Erasure Channels with Feedback.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019

Centralized Multi-Node Repair Regenerating Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Wireless MapReduce Distributed Computing.

[BibT_eX]

[DOI]

Fan Li

Jinyuan Chen

IEEE Trans. Inf. Theory, 2019

Age of Information in Multiple Sensing of a Single Source.

[BibT_eX]

[DOI]

CoRR, 2019

On the I/O Costs in Repairing Short-Length Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

LDPC Codes for Portable DNA Storage.

[BibT_eX]

[DOI]

Peng Fei

Proceedings of the IEEE International Symposium on Information Theory, 2019

Non-Stationary Polar Codes for Resistive Memories.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Global Communications Conference, 2019

Age of Information in Multiple Sensing.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018

Multi-Version Coding - An Information-Theoretic Perspective of Consistent Distributed Storage.

[BibT_eX]

[DOI]

Viveck R. Cadambe

IEEE Trans. Inf. Theory, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Storage-Efficient Shared Memory Emulation.

[BibT_eX]

[DOI]

CoRR, 2018

Code constructions for multi-node exact repair in distributed storage.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2018

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

[BibT_eX]

[DOI]

Bioinform., 2018

On the Achievability Region of Regenerating Codes for Multiple Erasures.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Optimal Rebuilding of Multiple Erasures in MDS Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Switch Codes: Codes for Fully Parallel Reconstruction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

The Capacity of Private Information Retrieval with Private Side Information.

[BibT_eX]

[DOI]

Syed Ali Jafar

CoRR, 2017

Centralized multi-node repair for minimum storage regenerating codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Rate-compatible and high-throughput architecture designs for encoding LDPC codes.

[BibT_eX]

[DOI]

Nishil Talati

Shahar Kvatinsky

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.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Explicit Minimum Storage Regenerating Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

smallWig: parallel compression of RNA-seq WIG files.

[BibT_eX]

[DOI]

Tsachy Weissman

Olgica Milenkovic

Bioinform., 2016

Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation.

[BibT_eX]

[DOI]

Viveck R. Cadambe

Nancy A. Lynch

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Centralized multi-node repair in distributed storage.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Optimal binary switch codes with small query size.

[BibT_eX]

[DOI]

Han Mao Kiah

Yuval Cassuto

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Access Versus Bandwidth in Codes for Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Explicit MDS Codes for Optimal Repair Bandwidth.

[BibT_eX]

[DOI]

CoRR, 2014

Multi-version coding in distributed storage.

[BibT_eX]

[DOI]

Viveck R. Cadambe

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Codes for network switches.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Long MDS codes for optimal repair bandwidth.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Access vs. bandwidth in codes for storage.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

MDS array codes with optimal rebuilding.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Patterned cells for phase change memories.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On codes for optimal rebuilding access.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Rebuilding for Array Codes in Distributed Storage Systems

[BibT_eX]

[DOI]

Alexandros G. Dimakis

CoRR, 2010

Partial rank modulation for flash memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

On the capacity of bounded rank modulation for flash memories.

[BibT_eX]

[DOI]

Anxiao Jiang