Computer Science – Information Theory
Scientific paper
2010-01-15
Computer Science
Information Theory
5 pages, a final version of a manuscript for ISIT2010
Scientific paper
A method of channel polarization, proposed by Arikan, allows us to construct efficient capacity-achieving channel codes. In the original work, binary input discrete memoryless channels are considered. A special case of $q$-ary channel polarization is considered by Sasoglu, Telatar, and Arikan. In this paper, we consider more general channel polarization on $q$-ary channels. We further show explicit constructions using Reed-Solomon codes, on which asymptotically fast channel polarization is induced.
Mori Ryuhei
Tanaka Toshiyuki
No associations
LandOfFree
Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels 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 Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-357475