21 citations · 30 across the 4 of their papers we have counts for
5 papers · 1 filter
Binary Polarization Kernels from Code Decompositions
Noam Presman, Ofer Shapira, Simon Litsyn +2
In this paper, code decompositions (a.k.a. code nestings) are used to design binary polarization kernels. The proposed kernels are in general non-linear. They provide a better pola…
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
Alex Bazarsky, Noam Presman, Simon Litsyn
An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control ove…
Recursive Descriptions of Polar Codes
Noam Presman, Simon Litsyn
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancel…
Polar Codes with Mixed-Kernels
Noam Presman, Ofer Shapira, Simon Litsyn
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymp…
Binary Polar Code Kernels from Code Decompositions
Noam Presman, Ofer Shapira, Simon Litsyn
Code decompositions (a.k.a code nestings) are used to design good binary polar code kernels. The proposed kernels are in general non-linear and show a better rate of polarization u…