2024
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes.
IEEE Trans. Inf. Theory, November, 2024
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits.
IEEE Trans. Inf. Theory, February, 2024
2023
All the Codeword Symbols in Polar Codes Have the Same SER Under the SC Decoder.
IEEE Trans. Commun., July, 2023
Constructing MSR Codes With Subpacketization 2<sup>n/3</sup> for k + 1 Helper Nodes.
IEEE Trans. Inf. Theory, June, 2023
Adjacent-Bits-Swapped Polar Codes: A New Code Construction to Speed up Polarization.
IEEE Trans. Inf. Theory, April, 2023
Neural decoders with permutation invariant structure.
J. Frankl. Inst., 2023
Found. Trends Commun. Inf. Theory, 2023
The size of Levenshtein ball with radius 2: Expectation and concentration bound.
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity.
IEEE Trans. Inf. Theory, 2022
All the codeword bits in polar codes have the same BER under the SC decoder.
CoRR, 2022
Improving the List Decoding Version of the Cyclically Equivariant Neural Decoder.
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
Exact Recovery and Sharp Thresholds of Stochastic Ising Block Model.
IEEE Trans. Inf. Theory, 2021
Reed-Muller Codes: Theory and Algorithms.
IEEE Trans. Inf. Theory, 2021
A Dynamic Programming Method to Construct Polar Codes with Improved Performance.
CoRR, 2021
On the extremal configurations of MAC polarization over erasure channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021
Cyclically Equivariant Neural Decoders for Cyclic Codes.
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n)).
IEEE Trans. Inf. Theory, 2020
Error Correction Based on Partial Information.
IEEE Trans. Inf. Theory, 2020
Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2020
Reed-Muller Codes Polarize.
IEEE Trans. Inf. Theory, 2020
Recursive Projection-Aggregation Decoding of Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2020
Repair of RS codes with optimal access and error correction.
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters.
IEEE Trans. Inf. Theory, 2019
The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.
IEEE Trans. Inf. Theory, 2019
Ar?kan meets Shannon: Polar codes with near-optimal convergence to channel capacity.
Electron. Colloquium Comput. Complex., 2019
2018
Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy.
IEEE Trans. Inf. Theory, 2018
Construction of Polar Codes for Arbitrary Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2018
Optimal locally private estimation under 𝓁<sub>p</sub> loss for 1≤ p≤ 2.
CoRR, 2018
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size.
CoRR, 2018
Optimal MDS codes for cooperative repair.
CoRR, 2018
Optimal Regenerating Codes for Cooperative Repair.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Communication-Computation Efficient Gradient Coding.
Proceedings of the 35th International Conference on Machine Learning, 2018
Clay Codes: Moulding MDS Codes to Yield an MSR Code.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018
2017
Coding Schemes for Distributed Storage Systems.
PhD thesis, 2017
Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization.
IEEE Trans. Inf. Theory, 2017
Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth.
IEEE Trans. Inf. Theory, 2017
Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures.
CoRR, 2017
Asymptotically optimal private estimation under mean square loss.
CoRR, 2017
Optimal schemes for discrete distribution estimation under local differential privacy.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Fractional decoding: Error correction from partial information.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound.
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.
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Polar codes for distributed hierarchical source coding.
Adv. Math. Commun., 2015
Polar codes using dynamic kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Universal source polarization and an application to a multi-user problem.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014