3 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.IT2017
Performance Bounds of Concatenated Polar Coding Schemes
Dina Goldin, David Burshtein
A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents…
cs.IT2015★ 1 cited
On the Finite Length Scaling of Ternary Polar Codes
Dina Goldin, David Burshtein
The polarization process of polar codes over a ternary alphabet is studied. Recently it has been shown that the scaling of the blocklength of polar codes with prime alphabet size s…
cs.IT2013★ 3 cited
Improved Bounds on the Finite Length Scaling of Polar Codes
Dina Goldin, David Burshtein
Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an impro…