Computing tight upper bounds for Bhattacharyya parameters of binary polar code kernels with arbitrary dimension
Open Access
- 7 April 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in EURASIP Journal on Wireless Communications and Networking
- Vol. 2021 (1), 1-21
- https://doi.org/10.1186/s13638-021-01954-y
Abstract
No abstract availableKeywords
Funding Information
- Research Fund for the Doctoral Program (JSY2018029, JY2019B162)
- Research Fund for the Doctoral Program (JSY2018029, JY2019B162)
This publication has 20 references indexed in Scilit:
- Multi-Kernel Polar Codes: Concept and Design PrinciplesIEEE Transactions on Communications, 2020
- Polar Codes: Bounds on Bhattacharyya Parameters and Their ApplicationsIEEE Transactions on Communications, 2018
- Multi-kernel polar codes: Proof of polarization and error exponentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- Multi-kernel construction of polar codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- Mixed-Kernels Constructions of Polar CodesIEEE Journal on Selected Areas in Communications, 2015
- Efficient Design and Decoding of Polar CodesIEEE Transactions on Communications, 2012
- Polar Codes: Characterization of Exponent, Bounds, and ConstructionsIEEE Transactions on Information Theory, 2010
- Performance of Polar Codes with the Construction using Density EvolutionIEEE Communications Letters, 2009
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Performance and construction of polar codes on symmetric binary-input memoryless channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009