Zobrazeno 1 - 10
of 260
pro vyhledávání: '"Litsyn, Simon"'
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 polarization exponent than the previously known kernels of the same dimens
Externí odkaz:
http://arxiv.org/abs/1410.8433
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 over the code's non-binary ACE spectrum and resulting in low error-floor.
Externí odkaz:
http://arxiv.org/abs/1304.7487
Peak power control for multicarrier communications has been a long-lasting problem in signal processing and communications. However, industry and academia are confronted with new challenges regarding energy efficient system design. Particularly, the
Externí odkaz:
http://arxiv.org/abs/1212.2865
Autor:
Presman, Noam, Litsyn, Simon
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allow
Externí odkaz:
http://arxiv.org/abs/1209.4818
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its polarization prop
Externí odkaz:
http://arxiv.org/abs/1107.0478
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 under successive cancelation decoding, than the ones suggested by Korad
Externí odkaz:
http://arxiv.org/abs/1101.0764
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better than the prev
Externí odkaz:
http://arxiv.org/abs/math/0610813
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds improve on the
Externí odkaz:
http://arxiv.org/abs/cs/0508107