Ido Tal

Orcid: 0000-0001-5419-1162

According to our database1, Ido Tal authored at least 30 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
An Analytical Study of the Min-Sum Approximation for Polar Codes.
CoRR, January, 2025

Constant Weight Polar Codes through Periodic Markov Processes.
CoRR, January, 2025

2024
Strong Polarization for Shortened and Punctured Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Dimensions of Channel Coding: From Theory to Algorithms to Applications.
IEEE J. Sel. Areas Inf. Theory, 2023

Stronger Polarization for the Deletion Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2021
An Upgrading Algorithm With Optimal Power Law.
IEEE Trans. Inf. Theory, 2021

Polar Codes for Channels with Insertions, Deletions, and Substitutions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
List Decoding of Universal Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Polar Codes for the Deletion Channel: Weak and Strong Polarization.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Universal Polarization for Processes with Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Fast Polarization for Processes with Memory.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
A Simple Proof of Fast Polarization.
IEEE Trans. Inf. Theory, 2017

A lower bound on the probability of error of polar codes over BMS channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Greedy-merge degrading has optimal power-law.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes.
IEEE Trans. Commun., 2016

Polar coding for processes with memory.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
On the construction of polar codes for channels with moderate input alphabet sizes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Channel upgradation for non-binary input alphabets and MACs.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
How to Construct Polar Codes.
IEEE Trans. Inf. Theory, 2013

Channel upgrading for semantically-secure encryption on wiretap channels.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Hardware Implementation of Successive-Cancellation Decoders for Polar Codes.
J. Signal Process. Syst., 2012

Constructing polar codes for non-binary alphabets and MACs.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Convex Programming Upper Bounds on the Capacity of 2-D Constraints.
IEEE Trans. Inf. Theory, 2011

List decoding of polar codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the construction of polar codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Hardware architectures for successive cancellation decoding of polar codes.
Proceedings of the IEEE International Conference on Acoustics, 2011

2009
Coding and bounds for two-dimensional constraints.
PhD thesis, 2009

Concave programming upper bounds on the capacity of 2-D constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Bounds on the rate of 2-D bit-stuffing encoders.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2006
On Row-by-Row Coding for 2-D Constraints.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006


  Loading...