暂无分享,去创建一个
[1] Eren Sasoglu. Polar Coding Theorems for Discrete Systems , 2011 .
[2] Ido Tal,et al. Polar coding for processes with memory , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[3] Ido Tal,et al. Fast Polarization for Processes with Memory , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).
[4] Rüdiger L. Urbanke,et al. Polar Codes: Characterization of Exponent, Bounds, and Constructions , 2010, IEEE Transactions on Information Theory.
[5] Ido Tal,et al. Polar Coding for Processes With Memory , 2019, IEEE Transactions on Information Theory.
[6] Rongke Liu,et al. Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels , 2014, ArXiv.
[7] Rongke Liu,et al. Construction of polar codes for channels with memory , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).
[8] Emre Telatar,et al. On the construction of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[9] Rüdiger L. Urbanke,et al. Finite-Length Scaling for Polar Codes , 2013, IEEE Transactions on Information Theory.
[10] Erdal Arikan,et al. Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.
[11] Alexander Vardy,et al. How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.
[12] Venkatesan Guruswami,et al. General strong polarization , 2018, Electron. Colloquium Comput. Complex..
[13] Venkatesan Guruswami,et al. Polar Codes: Speed of Polarization and Polynomial Gap to Capacity , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[14] Venkatesan Guruswami,et al. Polar Codes with Exponentially Small Error at Finite Block Length , 2018, APPROX-RANDOM.