A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels

Details A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels

2008-11-11

arxiv.org/abs/0811.1770v1

Computer Science

Information Theory

7 pages, 1 figure

Scientific paper

A generalization of Ar\i kan's polar code construction using transformations
of the form $G^{\otimes n}$ where $G$ is an $\ell \times \ell$ matrix is
considered. Necessary and sufficient conditions are given for these
transformations to ensure channel polarization. It is shown that a large class
of such transformations polarize symmetric binary-input memoryless channels.

Affiliated with

Also associated with

No associations

Rating

A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100150