Ido Tal

E-mail:	idotal@ee.technion.ac.il
Public key:	can be found by searching for the above at https://keys.openpgp.org
Phone:	+972-4-829-3358
Location:	Meir 656
	Department of Electrical Engineering
	Technion – Israel Institute of Technology
	Haifa 32000, Israel

Research Interests

Coding theory in general, polar codes, multidimensional constraints, list decoding

Teaching

Publications

Theses

Coding and Bounds for Two-Dimensional Constraints, I. Tal, Ph.D. thesis, Technion, IIT, 2009.
List decoding of Lee metric codes, I. Tal, M.Sc. thesis, Technion, IIT, 2003.

Preprints

An Analytical Study of the Min-Sum Approximation for Polar Codes, N. Chisnevski, I. Tal, S.Shamai (Shitz). Accepted to ISIT 2025. (expanded version).
Constant Weight Polar Codes through Periodic Markov Processes, B. Shuval, I. Tal. Accepted to ISIT 2025. (expanded version).

Journal Articles

Stronger Polarization for the Deletion Channel, D. Arava, I. Tal. IEEE Trans. Inform. Theory, 71:5192-5214, 2025.
Universal Polarization for Processes with Memory, B. Shuval, I. Tal. IEEE Trans. Inform. Theory, 71:1705-1757, 2025.
Polar Codes for the Deletion Channel: Weak and Strong Polarization, I. Tal, H. D. Pfister, A. Fazeli, A. Vardy. IEEE Trans. Inform. Theory, 68:2239-2265, 2022.
An Upgrading Algorithm with Optimal Power Law, O. Ordentlich, I. Tal. IEEE Trans. Inform. Theory, 67:7822-7836, 2021.
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels, B. Shuval, I. Tal. IEEE Trans. Inform. Theory, 65:2021-2045, 2019. (code)
Fast Polarization for Processes with Memory, B. Shuval, I. Tal. IEEE Trans. Inform. Theory, 65:2004-2020, 2019.
Polar Coding for Processes with Memory, E. Şaşoğlu, I. Tal. IEEE Trans. Inform. Theory, 65:1994-2003, 2019.
Greedy-Merge Degrading has Optimal Power-Law, A. Kartowsky, I. Tal. IEEE Trans. Inform. Theory, 65:917-934, 2019.
A Simple Proof of Fast Polarization, I. Tal. IEEE Trans. Inform. Theory, 63:7617-7619, 2017.
On the construction of polar codes for channels with moderate input alphabet sizes, I. Tal. IEEE Trans. Inform. Theory, 63:1501-1509, 2017.
Channel Upgradation for Non-Binary Input Alphabets and MACs, U. Pereg, I. Tal. IEEE Trans. Inform. Theory, 63:1410-1424, 2017.
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes, G. Sarkis, I. Tal, P. Giard, A. Vardy, C. Thibeault, W. J. Gross. IEEE Trans. Commun. Theory, 64:2732-2745, 2016.
List decoding of polar codes, I. Tal, A.Vardy. IEEE Trans. Inform. Theory, 61:2213-2226, 2015.
How to construct polar codes, I. Tal, A. Vardy. IEEE Trans. Inform. Theory, 59:6562-6582, 2013. (code)
Hardware implementation of successive cancellation decoders for polar codes, C. Leroux, A. J. Raymond, G. Sarkis, I. Tal, A. Vardy, W. J. Gross. J. Signal Process. Syst., 69:305-315, 2012.
Convex programming upper bounds on the capacity of 2-D constraints, I. Tal, R. M. Roth. IEEE Trans. Inform. Theory, 57:381-391, 2011.
Bounds on the rate of 2-D bit-stuffing encoders, I. Tal, R. M. Roth. IEEE Trans. Inform. Theory, 56:2561-2567, 2010.
On row-by-row coding for 2-D constraints, I. Tal, T. Etzion, R. M. Roth. IEEE Trans. Inform. Theory, 55:3565-3576, 2009.

Invited Talks

An Upgrading Algorithm with Optimal Power Law, O. Ordentlich, I. Tal. In Proc. Int'l Zurich Seminar on Inform. and Comm. (IZS'2020), Zurich, Switzerland, 2020. (slides)

Refereed Conferences

Strong Polarization for Shortened and Punctured Polar Codes (including 5-page appendix), B. Shuval, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2024), Athens, Greece, 2024. (slides).
Stronger Polarization for the Deletion Channel (including 5-page appendix), D. Arava, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2023), Taipei, Taiwan, 2023. (slides)
Polar Codes for Channels with Insertions, Deletions, and Substitution, H. Pfister, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2021), Melbourne, Victoria, Australia, 2021. (slides)
List Decoding of Universal Polar Codes, B. Shuval, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2020), Los Angeles, California, 2020. (slides)
Polar Codes for the Deletion Channel: Weak and Strong Polarization, I. Tal, H. D. Pfister, A. Fazeli, A. Vardy. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2019), Paris, France, 2019. (slides)
Universal Polarization for Processes with Memory, B. Shuval, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2019), Paris, France, 2019. (slides)
Fast Polarization for Processes with Memory, B. Shuval, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2018), Vail, Colorado, 2018. (slides, longer slides)
Greedy-Merge Degrading has Optimal Power-Law, A. Kartowsky, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2017), Aachen, Germany, 2017. (slides)
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels, B. Shuval, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2017), Aachen, Germany, 2017. (slides)
Polar Coding for Processes with Memory, E. Şaşoğlu, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2016), Barcelona, Spain, 2016. (slides)
On the construction of polar codes for channels with moderate input alphabet sizes, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2015), Hong Kong, 2015. (slides)
Channel Upgradation for Non-Binary Input Alphabets and MACs, U. Pereg, I. Tal. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2014), Honolulu, Hawaii, 2014. (slides)
Channel upgrading for semantically-secure encryption on wiretap channels, I. Tal, A. Vardy. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2013), Istanbul, Turkey, 2013. (slides)
Constructing Polar Codes for Non-Binary Alphabets and MACs, I. Tal, A. Sharov, A. Vardy. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2012), pages 2132-2136, Cambridge, Massachusetts, 2012. (slides)
List decoding of polar codes, I. Tal, A. Vardy. In Proc. IEEE Int'l Symp. on Inform. Theory (ISIT'2011), pages 1-5, Saint Petersburg, Russia, 2011. (slides)
On the construction of polar codes, R. Pedarsani, S. H. Hassani, I. Tal, E. Telatar. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2011), pages 11-15, Saint Petersburg, Russia, 2011.
Hardware architectures for successive cancellation decoding of polar codes, C. Leroux, I. Tal, A. Vardy, and W. J. Gross. In Proc. IEEE Int'l Conf. Acoust. Speech Signal Process. (ICASSP'2011), pages 1665-1668, Prague, Czech Republic, 2011.
How to construct polar codes, I. Tal, A. Vardy, In Proc. IEEE Inform. Theory Workshop (ITW'2010), Dublin, Ireland, 2010.
Concave programming upper bounds on the capacity of 2-D constraints, I. Tal, R. M. Roth. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2009), pages 1060-1064, Seoul, Korea, 2009. (slides)
Bounds on the rate of 2-D bit-stuffing encoders, I. Tal, R. M. Roth. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2008), pages 1463-1467, Toronto, Ontario, Canada, 2008. (slides)
On row-by-row coding for 2-D constraints, I. Tal, T. Etzion, R. M. Roth. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2006), pages 1204-1208, Seattle, Washington, 2006. (slides)
On list decoding of alternant codes in the Hamming and Lee metrics, I. Tal, R. M. Roth. In Proc. IEEE Int'l Symp. Inform. Theory (ISIT'2003), page 364, Yokohama, Japan, 2003. (slides)