2000 character limit reached
Weight Structure of Low/High-Rate Polar Codes and Its Applications (2402.12707v1)
Published 20 Feb 2024 in cs.IT and math.IT
Abstract: The structure of a linear block code is pivotal in defining fundamental properties, particularly weight distribution, and code design. In this study, we characterize the Type II structure of polar codewords with weights less than twice the minimum weight $w_{min}$, utilizing the lower triangular affine (LTA) transform. We present a closed-form formula for their enumeration. Leveraging this structure and additionally characterizing the structure of weight $2w_{min}$, we ascertain the complete weight distribution of low-rate and, through the utilization of dual codes properties, high-rate polar codes, subcodes of Reed--Muller (RM) codes, and RMxPolar codes. Furthermore, we introduce a partial order based on the weight distribution and briefly explore its properties and applications in code construction and analysis.
- E. Arıkan “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels” In IEEE Trans. Inf. Theory 55.7, 2009, pp. 3051–3073
- “Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes” In Post-Quantum Cryptography, vol. 9606, 2016, pp. 118–143
- “On the weight structure of Reed-Muller codes” In Trans. Inf. Theory 16.6, 1970, pp. 752–759
- T. Kasami, N. Tokura and S. Azumi “On the weight enumeration of weights less than 2.5d of Reed—Muller codes” In Information and Control 30.4, 1976, pp. 380–395
- “Algebraic properties of polar codes from a new polynomial formalism” In 2016 IEEE Int. Symp. Inf. Theory (ISIT), 2016, pp. 230–234
- M. Rowshan, V.F. Dragoi and J. Yuan “On the Closed-form Weight Enumeration of Polar Codes: 1.5wminsubscriptw\operatorname{w}_{\min}roman_w start_POSTSUBSCRIPT roman_min end_POSTSUBSCRIPT-codewords”, 2023 arXiv: http://arxiv.org/abs/2305.02921
- “The complete affine automorphism group of polar codes” In 2021 IEEE Global Communications Conference (GLOBECOM), 2021, pp. 01–06 IEEE
- C. Pillet, V. Bioglio and I. Land “Classification of automorphisms for the decoding of polar codes” In ICC 2022 - IEEE International Conference on Communications, 2022, pp. 110–115
- “On the efficiency of polar-like decoding for symmetric codes” In IEEE Transactions on Communications 70.1, 2022, pp. 163–170
- “Polar codes do not have many affine automorphisms” In 2022 IEEE International Symposium on Information Theory (ISIT), 2022, pp. 2374–2378
- Charles Pillet, Valerio Bioglio and Pascal Giard “On the distribution of partially-symmetric codes for automorphism ensemble decoding” In 2023 IEEE Information Theory Workshop (ITW), 2023, pp. 36–41 IEEE
- “Automorphism ensemble decoding of Reed-Muller codes” In IEEE Trans. Commun. 69.10, 2021, pp. 6424–6438
- “On the automorphism group of polar codes” 2021 IEEE Int. Symp. Inf. Theory (ISIT), 2021, pp. 1230–1235
- M. Rowshan, A. Burg and E. Viterbo “Polarization-adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding” In in IEEE Trans. on Vehicular Technology 70.2, 2021, pp. 1434–1447
- Vlad Florin Dragoi “An algebraic approach for the resolution of algorithmic problems raised by cryptography and coding theory”, 2017
- “The weight enumerator for second-order Reed-Muller codes” In IEEE Trans. Information Theory 16.6, pp. 745–751
- Jessie Macwilliams “A theorem on the distribution of weights in a systematic code” In The Bell System Technical Journal 42.1, 1963, pp. 79–94 DOI: 10.1002/j.1538-7305.1963.tb04003.x
- URL: https://isec.ec.okayama-u.ac.jp/home/kusaka/wd/index.html
- Wieb Bosma, John Cannon and Catherine Playoust “The Magma algebra system. I. The user language” Computational algebra and number theory (London, 1993) In J. Symbolic Comput. 24.3-4, 1997, pp. 235–265 DOI: 10.1006/jsco.1996.0125
- “Performance and construction of polar codes on symmetric binary-input memoryless channels” In Proc. IEEE ISIT, 2009, pp. 1496–1500
- Christian Schürch “A partial order for the synthesized channels of a polar code” In 2016 IEEE Int. Symp. Inf. Theory (ISIT), 2016, pp. 220–224
- “Fast Methods for Ranking Synthetic BECs” In 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 1562–1567 DOI: 10.1109/ISIT54713.2023.10206704
- Sinan Kahraman “Strange Attractor for Efficient Polar Code Design” In ArXiv abs/1708.04167, 2017 URL: https://api.semanticscholar.org/CorpusID:39517234
- Erik Ordentlich and Ron M. Roth “On the pointwise threshold behavior of the binary erasure polarization subchannels” In 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 859–863 DOI: 10.1109/ISIT.2017.8006650
- Wei Wu and Paul H. Siegel “Generalized Partial Orders for Polar Code Bit-Channels” In IEEE Transactions on Information Theory 65.11, 2019, pp. 7114–7130 DOI: 10.1109/TIT.2019.2930292
- “Bhattacharyya Parameter of Monomial Codes for the Binary Erasure Channel: From Pointwise to Average Reliability” In Sensors 21.9, 2021 DOI: 10.3390/s21092976
- G.He al. “Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes” In GLOBECOM 2017 - 2017 IEEE Global Communications Conference, Singapore, 2017, pp. 1–6
- EJ Cheon “Equivalence of linear codes with the same weight enumerator” In Scientiae Mathematicae Japonicae 64.1 Osaka, Japan: Japanese Association of Mathematical Sciences, 2001-, 2006, pp. 163