| 2025 | ISIT | An Analytical Study of the Min-Sum Approximation for Polar Codes. | Nir Chisnevski, Ido Tal, Shlomo Shamai Shitz |
| 2025 | ISIT | Constant Weight Polar Codes Through Periodic Markov Processes. | Boaz Shuval, Ido Tal |
| 2024 | ISIT | Strong Polarization for Shortened and Punctured Polar Codes. | Boaz Shuval, Ido Tal |
| 2023 | ISIT | Stronger Polarization for the Deletion Channel. | Dar Arava, Ido Tal |
| 2021 | ISIT | Polar Codes for Channels with Insertions, Deletions, and Substitutions. | Henry D. Pfister, Ido Tal |
| 2020 | ISIT | List Decoding of Universal Polar Codes. | Boaz Shuval, Ido Tal |
| 2019 | ISIT | Universal Polarization for Processes with Memory. | Boaz Shuval, Ido Tal |
| 2019 | ISIT | Polar Codes for the Deletion Channel: Weak and Strong Polarization. | Ido Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy |
| 2018 | ISIT | Fast Polarization for Processes with Memory. | Boaz Shuval, Ido Tal |
| 2017 | ISIT | Greedy-merge degrading has optimal power-law. | Assaf Kartowsky, Ido Tal |
| 2017 | ISIT | A lower bound on the probability of error of polar codes over BMS channels. | Boaz Shuval, Ido Tal |
| 2016 | ISIT | Polar coding for processes with memory. | Eren Sasoglu, Ido Tal |
| 2015 | ISIT | On the construction of polar codes for channels with moderate input alphabet sizes. | Ido Tal |
| 2014 | ISIT | Channel upgradation for non-binary input alphabets and MACs. | Uzi Pereg, Ido Tal |
| 2013 | ISIT | Channel upgrading for semantically-secure encryption on wiretap channels. | Ido Tal, Alexander Vardy |
| 2012 | ISIT | Constructing polar codes for non-binary alphabets and MACs. | Ido Tal, Artyom Sharov, Alexander Vardy |
| 2011 | ICASSP | Hardware architectures for successive cancellation decoding of polar codes. | Camille Leroux, Ido Tal, Alexander Vardy, Warren J. Gross |
| 2011 | ISIT | On the construction of polar codes. | Ramtin Pedarsani, Seyed Hamed Hassani, Ido Tal, Emre Telatar |
| 2011 | ISIT | List decoding of polar codes. | Ido Tal, Alexander Vardy |
| 2009 | ISIT | Concave programming upper bounds on the capacity of 2-D constraints. | Ron M. Roth, Ido Tal |
| 2008 | ISIT | Bounds on the rate of 2-D bit-stuffing encoders. | Ido Tal, Ron M. Roth |
| 2006 | ISIT | On Row-by-Row Coding for 2-D Constraints. | Ido Tal, Tuvi Etzion, Ron M. Roth |