<![CDATA[ Selected Areas in Communications, IEEE Journal on - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 49 2016February 08<![CDATA[Table of contents]]>342C1C4169<![CDATA[IEEE Journal on Selected Areas in Communications]]>342C2C277<![CDATA[Guest Editorial Recent Advances in Capacity Approaching Codes]]>342205208368<![CDATA[On the Origin of Polar Coding]]>3422092231029<![CDATA[Alignment of Polarized Sets]]> channels from the instances of the physical channel by a simple linear encoding transformation. Each synthesized channel corresponds to a particular input to the encoder. For large , the synthesized channels become either essentially noiseless or almost perfectly noisy, but in total carry as much information as the original channels. Capacity can therefore be achieved by transmitting messages over the essentially noiseless synthesized channels. Unfortunately, the set of inputs corresponding to reliable synthesized channels is poorly understood, in particular, how the set depends on the underlying physical channel. In this work, we present two analytic conditions sufficient to determine if the reliable inputs corresponding to different discrete memoryless channels are aligned or not, i.e., if one set is contained in the other. Understanding the alignment of the polarized sets is important as it is directly related to universality properties of the induced polar codes, which are essential in particular for network coding problems. We demonstrate the performance of our conditions on a few examples for wiretap and broadcast channels. Finally, we show that these conditions imply that the simple quantum polar coding scheme of Renes et al. [Phys. Rev. Lett., 109, 050504, 2012] requires entanglement assistance for general channels, but also show such assistance to be unnecessary in many cases of interest.]]>342224238810<![CDATA[Mixed-Kernels Constructions of Polar Codes]]>342239253929<![CDATA[Polar Subcodes]]>3422542661365<![CDATA[Interleaved Concatenations of Polar Codes With BCH and Convolutional Codes]]>3422672771150<![CDATA[Polar Coding for the General Wiretap Channel With Extensions to Multiuser Scenarios]]>342278291598<![CDATA[A Split-Reduced Successive Cancellation List Decoder for Polar Codes]]>N-K_{1}+1, after which the successive cancellation decoder achieves the same error performance as the maximum likelihood decoder if all the prior unfrozen bits are correctly decoded, which enables further complexity reduction. Simulation results demonstrate that the proposed low complexity SCL decoder attains performance similar to that of the conventional SCL decoder, while achieving substantial complexity reduction.]]>342292302937<![CDATA[A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes]]>3423033171651<![CDATA[Fast List Decoders for Polar Codes]]>342318328793<![CDATA[Finite-Length Algebraic Spatially-Coupled Quasi-Cyclic LDPC Codes]]>3423293442139<![CDATA[On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs]]>3423453611684<![CDATA[Performance Analysis of Block Markov Superposition Transmission of Short Codes]]>3423623741421<![CDATA[On the Total Power Capacity of Regular-LDPC Codes With Iterative Message-Passing Decoders]]>342375396859<![CDATA[Protograph-Based LDPC Code Design for Shaped Bit-Metric Decoding]]>2(1 + SNR) for a target frame error rate of 10^{-3} at spectral 1 efficiencies of 1.38 and 4.25 bits/channel use, respectively.]]>3423974071090<![CDATA[Randomly Punctured LDPC Codes]]>3424084211593<![CDATA[Distance Spectrum of Fixed-Rate Raptor Codes With Linear Random Precoders]]>3424224361196<![CDATA[Inter-Frame Coding For Broadcast Communication]]>342437452956<![CDATA[Open Access]]>3424534531128<![CDATA[Information for Authors]]>342454454430<![CDATA[Introducing IEEE Collabratec]]>3424554551925<![CDATA[Member Get-A-Member (MGM) Program]]>3424564563353<![CDATA[IEEE Communications Society Information]]>342C3C3131