Concave programming upper bounds on the capacity of 2-D constraints. - Ron M. Roth; Ido Tal (ISIT, 2009)

On row-by-row coding for 2-D constraints. - Ido Tal; Tuvi Etzion; Ron M. Roth (IEEE Trans. Inf. Theory, 2009)

Coding and bounds for two-dimensional constraints. - Ido Tal (2009)

Bounds on the rate of 2-D bit-stuffing encoders. - Ido Tal; Ron M. Roth (IEEE Trans. Inf. Theory, 2010)

Hardware architectures for successive cancellation decoding of polar codes. - Camille Leroux; Ido Tal; Alexander Vardy; Warren J. Gross (ICASSP, 2011)

On the construction of polar codes. - Ramtin Pedarsani; Seyed Hamed Hassani; Ido Tal; Emre Telatar (ISIT, 2011)

Convex Programming Upper Bounds on the Capacity of 2-D Constraints. - Ido Tal; Ron M. Roth (IEEE Trans. Inf. Theory, 2011)

Constructing polar codes for non-binary alphabets and MACs. - Ido Tal; Artyom Sharov; Alexander Vardy (ISIT, 2012)

Hardware Implementation of Successive-Cancellation Decoders for Polar Codes. - Camille Leroux; Alexandre J. Raymond; Gabi Sarkis; Ido Tal; Alexander Vardy; Warren J. Gross (J. Signal Process. Syst., 2012)

Channel upgrading for semantically-secure encryption on wiretap channels. - Ido Tal; Alexander Vardy (ISIT, 2013)

How to Construct Polar Codes. - Ido Tal; Alexander Vardy (IEEE Trans. Inf. Theory, 2013)

List Decoding of Polar Codes. - Ido Tal; Alexander Vardy (IEEE Trans. Inf. Theory, 2015)

Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes. - Gabi Sarkis; Ido Tal; Pascal Giard; Alexander Vardy; Claude Thibeault; Warren J. Gross (IEEE Trans. Commun., 2016)

Channel Upgradation for Non-Binary Input Alphabets and MACs. - Uzi Pereg; Ido Tal (IEEE Trans. Inf. Theory, 2017)

On the Construction of Polar Codes for Channels With Moderate Input Alphabet Sizes. - Ido Tal (IEEE Trans. Inf. Theory, 2017)

A Simple Proof of Fast Polarization. - Ido Tal (IEEE Trans. Inf. Theory, 2017)

Greedy-Merge Degrading has Optimal Power-Law. - Assaf Kartowsky; Ido Tal (IEEE Trans. Inf. Theory, 2019)

Polar Coding for Processes With Memory. - Eren Sasoglu; Ido Tal (IEEE Trans. Inf. Theory, 2019)

Fast Polarization for Processes With Memory. - Boaz Shuval; Ido Tal (IEEE Trans. Inf. Theory, 2019)

A Lower Bound on the Probability of Error of Polar Codes over BMS Channels. - Boaz Shuval; Ido Tal (IEEE Trans. Inf. Theory, 2019)

List Decoding of Universal Polar Codes. - Boaz Shuval; Ido Tal (ISIT, 2020)

Polar Codes for Channels with Insertions, Deletions, and Substitutions. - Henry D. Pfister; Ido Tal (ISIT, 2021)

An Upgrading Algorithm With Optimal Power Law. - Or Ordentlich; Ido Tal (IEEE Trans. Inf. Theory, 2021)

Polar Codes for the Deletion Channel: Weak and Strong Polarization. - Ido Tal; Henry D. Pfister; Arman Fazeli; Alexander Vardy (IEEE Trans. Inf. Theory, 2022)

Dimensions of Channel Coding: From Theory to Algorithms to Applications. - Tuvi Etzion; Paul H. Siegel; Han Mao Kiah; Hessam Mahdavifar; Farzad Parvaresh; Moshe Schwartz 001; Ido Tal; Eitan Yaakobi; Xinmiao Zhang 001 (IEEE J. Sel. Areas Inf. Theory, 2023)

Strong Polarization for Shortened and Punctured Polar Codes. - Boaz Shuval; Ido Tal (ISIT, 2024)

Constant Weight Polar Codes through Periodic Markov Processes. - Boaz Shuval; Ido Tal (CoRR, 2025)

An Analytical Study of the Min-Sum Approximation for Polar Codes. - Nir Chisnevski; Ido Tal; Shlomo Shamai (CoRR, 2025)

Universal Polarization for Processes With Memory. - Boaz Shuval; Ido Tal (IEEE Trans. Inf. Theory, 2025)

Stronger Polarization for the Deletion Channel. - Dar Arava; Ido Tal (IEEE Trans. Inf. Theory, 2025)