Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length

Résumé

Reed Muller (RM) codes are known for their good minimum distance. One can use their structure to construct polar-like codes with good distance properties by choosing the information set as the rows of the polarization matrix with the highest Hamming weight, instead of the most reliable synthetic channels. However, the information length options of RM codes are quite limited due to their specific structure. In this work, we present sufficient conditions to increase the information length by at least one bit for some underlying RM codes and in order to obtain pre-transformed polar-like codes with the same minimum distance than lower rate codes. Moreover, our findings are combined with the method presented in [1] to further reduce the number of minimum weight codewords. Numerical results show that the designed codes perform close to the meta-converse bound at short blocklengths and better than the polarized adjusted convolutional polar codes with the same parameters.
Fichier principal
Vignette du fichier
ISIT22.pdf (274.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03668771 , version 1 (16-05-2022)

Identifiants

Citer

Samet Gelincik, Philippe Mary, Anne Savard, Jean-Yves Baudais. Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length. International Symposium on Information Theory (ISIT) 2022, Jun 2022, Aalto, Finland. ⟨10.1109/ISIT50566.2022.9834446⟩. ⟨hal-03668771⟩
73 Consultations
166 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More