Using concatenated algebraic geometry codes in channel polarization (original) (raw)
Related papers
On the construction of polar codes
2011 IEEE International Symposium on Information Theory Proceedings, 2011
IEEE Transactions on Information Theory, 2017
Polar Codes: Characterization of Exponent, Bounds, and Constructions
IEEE Transactions on Information Theory, 2010
On the construction and decoding of concatenated polar codes
2013 IEEE International Symposium on Information Theory, 2013
Construction and performance of algebraic–geometric codes over AWGN and fading channels
IEE Proceedings - Communications, 2005
From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance
IEEE Transactions on Communications, 2014
The compound capacity of polar codes
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009
Enabling complexity-performance trade-offs for successive cancellation decoding of polar codes
2014 IEEE International Symposium on Information Theory, 2014
Practical Product Code Construction of Polar Codes
IEEE Transactions on Signal Processing, 2020
A Practical Construction Method for Polar Codes
Performance of polar codes for channel and source coding
2009
Construction and Decoding of Product Codes with Non-Systematic Polar Codes
2019 IEEE Wireless Communications and Networking Conference (WCNC), 2019
Multi-kernel construction of polar codes
2017 IEEE International Conference on Communications Workshops (ICC Workshops), 2017
On the decoding of algebraic-geometric codes
IEEE Transactions on Information Theory, 1990
An Optimized Method for Polar Code Construction
International Journal of Advanced Computer Science and Applications, 2023
Vard{\o}hus Codes: Polar Codes Based on Castle Curves Kernels
arXiv (Cornell University), 2019
2013 Information Theory and Applications Workshop (ITA), 2013
Multi-Kernel Polar Codes: Concept and Design Principles
IEEE Transactions on Communications, 2020
Improved Power Decoding of Algebraic Geometry Codes
2021 IEEE International Symposium on Information Theory (ISIT), 2021
Vardøhus Codes: Polar Codes Based on Castle Curves Kernels
IEEE Transactions on Information Theory
Performance of short polar codes under ML decoding
2009
Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes
IEEE Transactions on Communications, 2014
On the Concatenations of Polar Codes and Non-Binary LDPC Codes
Recursive Descriptions of Decoding Algorithms and Hardware Architectures for Polar Codes
2012
On the Effects of Kernel Configuration in Multi-Kernel Polar Codes
Entropy
Towards Optimal Decoding for Polar Codes
arXiv (Cornell University), 2022
Polar codes: Robustness of the successive cancellation decoder with respect to quantization
2012 IEEE International Symposium on Information Theory Proceedings, 2012
Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
Anindya C Patthak, Venkatesan Guruswami
Mathematics of Computation, 2008
Binary Polarization Kernels from Code Decompositions
IEEE Transactions on Information Theory, 2015
Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length
2022 IEEE International Symposium on Information Theory (ISIT)
Polar Codes are Optimal for Lossy Source Coding
IEEE Transactions on Information Theory, 2010
Interleaved Concatenations of Polar Codes With BCH and Convolutional Codes
IEEE Journal on Selected Areas in Communications, 2016
A Pre-Transformation Method to Increase the Minimum Distance of Polar-Like Codes
arXiv (Cornell University), 2022
Polar codes with mixed kernels
2011 IEEE International Symposium on Information Theory Proceedings, 2011