Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
12 Publications
2024 | Published | Journal Article | IST-REx-ID: 17330 |

Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. IEEE Transactions on Information Theory. 2024;70(9):6211-6238. doi:10.1109/TIT.2024.3430842
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 14665 |

Zhang Y, Vatedka S. Multiple packing: Lower bounds via error exponents. IEEE Transactions on Information Theory. 2024;70(2):1008-1039. doi:10.1109/TIT.2023.3334032
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 15172 |

Esposito AR, Mondelli M. Concentration without independence via information measures. IEEE Transactions on Information Theory. 2024;70(6):3823-3839. doi:10.1109/TIT.2024.3367767
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 13269 |

Polyanskii N, Zhang Y. Codes for the Z-channel. IEEE Transactions on Information Theory. 2023;69(10):6340-6357. doi:10.1109/TIT.2023.3292219
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 12838 |

Zhang Y, Vatedka S. Multiple packing: Lower bounds via infinite constellations. IEEE Transactions on Information Theory. 2023;69(7):4513-4527. doi:10.1109/TIT.2023.3260950
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14751 |

Zhang Y. Zero-error communication over adversarial MACs. IEEE Transactions on Information Theory. 2023;69(7):4093-4127. doi:10.1109/tit.2023.3257239
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 10775 |

Ferber A, Kwan MA, Sauermann L. List-decodability with large radius for Reed-Solomon codes. IEEE Transactions on Information Theory. 2022;68(6):3823-3828. doi:10.1109/TIT.2022.3148779
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 11639 |

Zhang Y, Vatedka S. List decoding random Euclidean codes and Infinite constellations. IEEE Transactions on Information Theory. 2022;68(12):7753-7786. doi:10.1109/TIT.2022.3189542
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 12273 |

Zhang Y, Vatedka S, Jaggi S, Sarwate AD. Quadratically constrained myopic adversarial channels. IEEE Transactions on Information Theory. 2022;68(8):4901-4948. doi:10.1109/tit.2022.3167554
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9002
Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. IEEE Transactions on Information Theory. 2021;67(9):5693-5710. doi:10.1109/TIT.2020.3038806
[Preprint]
View
| Files available
| DOI
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 6730 |

Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. Reed–Muller codes achieve capacity on erasure channels. IEEE Transactions on Information Theory. 2017;63(7):4298-4316. doi:10.1109/tit.2017.2673829
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Journal Article | IST-REx-ID: 6732 |

Mondelli M, Hassani SH, Urbanke RL. Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory. 2016;62(12):6698-6712. doi:10.1109/tit.2016.2616117
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv