Min Ye

IEEE Trans. Inf. Theory, February, 2024

2023

All the Codeword Symbols in Polar Codes Have the Same SER Under the SC Decoder.

[BibT_eX]

[DOI]

IEEE Trans. Commun., July, 2023

Constructing MSR Codes With Subpacketization 2<sup>n/3</sup> for k + 1 Helper Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2023

Adjacent-Bits-Swapped Polar Codes: A New Code Construction to Speed up Polarization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, April, 2023

Neural decoders with permutation invariant structure.

[BibT_eX]

[DOI]

Xiangyu Chen

J. Frankl. Inst., 2023

Reed-Muller Codes.

[BibT_eX]

[DOI]

Found. Trends Commun. Inf. Theory, 2023

MSR codes with linear field size and smallest sub-packetization for any number of helper nodes.

[BibT_eX]

[DOI]

CoRR, 2023

The size of Levenshtein ball with radius 2: Expectation and concentration bound.

[BibT_eX]

[DOI]

Lang He

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Andrii Riazanov

IEEE Trans. Inf. Theory, 2022

All the codeword bits in polar codes have the same BER under the SC decoder.

[BibT_eX]

[DOI]

CoRR, 2022

Improving the List Decoding Version of the Cyclically Equivariant Neural Decoder.

[BibT_eX]

[DOI]

Xiangyu Chen

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Exact Recovery and Sharp Thresholds of Stochastic Ising Block Model.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Reed-Muller Codes: Theory and Algorithms.

[BibT_eX]

[DOI]

Amir Shpilka

IEEE Trans. Inf. Theory, 2021

A Dynamic Programming Method to Construct Polar Codes with Improved Performance.

[BibT_eX]

[DOI]

CoRR, 2021

On the extremal configurations of MAC polarization over erasure channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Cyclically Equivariant Neural Decoders for Cyclic Codes.

[BibT_eX]

[DOI]

Xiangyu Chen

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n)).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Error Correction Based on Partial Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Zitan Chen

IEEE Trans. Inf. Theory, 2020

Reed-Muller Codes Polarize.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Recursive Projection-Aggregation Decoding of Reed-Muller Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Repair of RS codes with optimal access and error correction.

[BibT_eX]

[DOI]

Zitan Chen

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Ar?kan meets Shannon: Polar codes with near-optimal convergence to channel capacity.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Andrii Riazanov

Electron. Colloquium Comput. Complex., 2019

2018

Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Construction of Polar Codes for Arbitrary Discrete Memoryless Channels.

[BibT_eX]

[DOI]

Talha Cihad Gülcü

IEEE Trans. Inf. Theory, 2018

Optimal locally private estimation under 𝓁<sub>p</sub> loss for 1≤ p≤ 2.

[BibT_eX]

[DOI]

CoRR, 2018

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size.

[BibT_eX]

[DOI]

CoRR, 2018

Optimal MDS codes for cooperative repair.

[BibT_eX]

[DOI]

CoRR, 2018

Optimal Regenerating Codes for Cooperative Repair.

[BibT_eX]

[DOI]

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

Communication-Computation Efficient Gradient Coding.

[BibT_eX]

[DOI]

Srinivasan Narayanamurthy

Proceedings of the 35th International Conference on Machine Learning, 2018

Clay Codes: Moulding MDS Codes to Yield an MSR Code.

[BibT_eX]

[DOI]

Syed Hussain

Siddhartha Nandi

Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

2017

Coding Schemes for Distributed Storage Systems.

[BibT_eX]

[DOI]

PhD thesis, 2017

Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures.

[BibT_eX]

[DOI]

CoRR, 2017

Asymptotically optimal private estimation under mean square loss.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal schemes for discrete distribution estimation under local differential privacy.

[BibT_eX]

[DOI]

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

Fractional decoding: Error correction from partial information.

[BibT_eX]

[DOI]

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

Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Polar codes for distributed hierarchical source coding.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

Polar codes using dynamic kernels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Universal source polarization and an application to a multi-user problem.

[BibT_eX]

[DOI]