3 papers
cs.IT2025
An Analytical Study of the Min-Sum Approximation for Polar Codes
Nir Chisnevski, Ido Tal, Shlomo Shamai
The min-sum approximation is widely used in the decoding of polar codes. Although it is a numerical approximation, hardly any penalties are incurred in practice. We give a theoreti…
cs.IT2025
Constant Weight Polar Codes through Periodic Markov Processes
Boaz Shuval, Ido Tal
Constant weight codes can arise from an input process sampled from a periodic Markov chain. A previous result showed that, in general, polarization does not occur for input-output…
cs.IT2024
Stronger Polarization for the Deletion Channel
Dar Arava, Ido Tal
In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like , where is the length of the codeword.…