activity
20172025
most citedUniversal Polarization for Processes with Memory

9 citations · 11 across the 6 of their papers we have counts for

collaborators
Showing cs.ITShow all

6 papers · 1 filter

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

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…

cs.IT2020

List Decoding of Universal Polar Codes

Boaz Shuval, Ido Tal

A list decoding scheme for universal polar codes is presented. Our scheme applies to the universal polar codes first introduced by Sasoglu and Wang, and generalized to processes wi…

cs.IT2018★ 9 cited

Universal Polarization for Processes with Memory

Boaz Shuval, Ido Tal

A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the…

cs.IT2017★ 2 cited

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…

cs.IT2017

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…