114 citations · 249 across the 25 of their papers we have counts for
5 papers · 1 filter
Fast Polarization for Processes with Memory
Boaz Shuval, Ido Tal
Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in the square root of the…
A Simple Proof of Fast Polarization
Ido Tal
Fast polarization is an important and useful property of polar codes. It was proved for the binary polarizing kernel by Arikan and Telatar. The proof was later general…
Greedy-Merge Degrading has Optimal Power-Law
Assaf Kartowsky, Ido Tal
Consider a channel with a given input alphabet size and a given input distribution. Our aim is to degrade or upgrade it to a channel with at most L output letters. The paper contai…
Greedy-Merge Degrading has Optimal Power-Law
Assaf Kartowsky, Ido Tal
Consider a channel with a given input distribution. Our aim is to degrade it to a channel with at most L output letters. One such degradation method is the so called "greedy-merge"…
A Lower Bound on the Probability of Error of Polar Codes over BMS Channels
Boaz Shuval, Ido Tal
Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the…