114 citations · 249 across the 25 of their papers we have counts for
26 papers
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…
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…
Strong Polarization for Shortened and Punctured Polar Codes
Boaz Shuval, Ido Tal
Polar codes were originally specified for codelengths that are powers of two. In many applications, it is desired to have a code that is not restricted to such lengths. Two common…
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. Th…
Polar Codes for Channels with Insertions, Deletions, and Substitutions
Henry D. Pfister, Ido Tal
This paper presents a coding scheme for an insertion deletion substitution channel. We extend a previous scheme for the deletion channel where polar codes are modified by adding "g…
An Upgrading Algorithm with Optimal Power Law
Or Ordentlich, Ido Tal
Consider a channel along with a given input distribution . In certain settings, such as in the construction of polar codes, the output alphabet of is `too large', and…