Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
52 Publications
2021 | Conference Paper | IST-REx-ID: 10599 | 
Hashemi, S. A., Mondelli, M., Cioffi, J., & Goldsmith, A. (2021). Successive syndrome-check decoding of polar codes. In Proceedings of the 55th Asilomar Conference on Signals, Systems, and Computers (Vol. 2021–October, pp. 943–947). Virtual, Pacific Grove, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/IEEECONF53345.2021.9723394
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 13146 |
Nguyen, Q., Mondelli, M., & Montufar, G. (2021). Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 8119–8129). Virtual: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2021 | Journal Article | IST-REx-ID: 9047 |
Mondelli, M., Hashemi, S. A., Cioffi, J. M., & Goldsmith, A. (2021). Sublinear latency for simplified successive cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. IEEE. https://doi.org/10.1109/TWC.2020.3022922
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10053 |
Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith, A. (2021). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In 2021 IEEE International Symposium on Information Theory (pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT45174.2021.9518153
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10597 |
Fathollahi, D., Farsad, N., Hashemi, S. A., & Mondelli, M. (2021). Sparse multi-decoder recursive projection aggregation for Reed-Muller codes. In 2021 IEEE International Symposium on Information Theory (pp. 1082–1087). Virtual, Melbourne, Australia: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/isit45174.2021.9517887
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv