Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels
classification
💻 cs.IT
math.IT
keywords
channelsarbitrarily-permutedparallelcapacity-achievingcodingpolarbinary-inputchannel
read the original abstract
Channel coding over arbitrarily-permuted parallel channels was first studied by Willems et al. (2008). This paper introduces capacity-achieving polar coding schemes for arbitrarily-permuted parallel channels where the component channels are memoryless, binary-input and output-symmetric.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.