Polar codes using dynamic kernels
Authors:
- 1 June 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 231-235
Abstract
In the standard polar coding construction, the same kernel is used for every channel transformation. In this paper we propose a new polar coding scheme in which the channel combining transformation is dynamically chosen based on the properties of the virtual channels. We show that for some cases it can improve the finite-length performance of codes. We also show that the dynamic scheme retains some of the main properties of the original polar code construction.Keywords
This publication has 8 references indexed in Scilit:
- On the scaling exponent of binary polarization kernels2014
- Finite-Length Scaling for Polar CodesIEEE Transactions on Information Theory, 2014
- Polar codes with dynamic frozen symbols and their decoding by directed search2013
- Achieving the Secrecy Capacity of Wiretap Channels Using Polar CodesIEEE Transactions on Information Theory, 2011
- Polar Codes: Characterization of Exponent, Bounds, and ConstructionsIEEE Transactions on Information Theory, 2010
- Polar coding for secure transmission and key agreement2010
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- On the rate of channel polarization2009