Preserving the Minimum Distance of Polar-Like ...
Type de document :
Communication dans un congrès avec actes
Titre :
Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length
Auteur(s) :
Gelincik, Samet [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Mary, Philippe [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Savard, Anne [Auteur]
Circuits Systèmes Applications des Micro-ondes - IEMN [CSAM - IEMN ]
Ecole nationale supérieure Mines-Télécom Lille Douai [IMT Nord Europe]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
Baudais, Jean-Yves [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Institut d'Électronique et des Technologies du numéRique [IETR]
Mary, Philippe [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Savard, Anne [Auteur]

Circuits Systèmes Applications des Micro-ondes - IEMN [CSAM - IEMN ]
Ecole nationale supérieure Mines-Télécom Lille Douai [IMT Nord Europe]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
Baudais, Jean-Yves [Auteur]
Institut d'Électronique et des Technologies du numéRique [IETR]
Titre de la manifestation scientifique :
International Symposium on Information Theory (ISIT) 2022
Ville :
Aalto
Pays :
Finlande
Date de début de la manifestation scientifique :
2022-06-26
Titre de l’ouvrage :
International Symposium on Information Theory (ISIT) 2022
Titre de la revue :
International Symposium on Information Theory
Mot(s)-clé(s) en anglais :
code extension
minimum distance
Reed Muller codes
Polar codes
minimum distance
Reed Muller codes
Polar codes
Discipline(s) HAL :
Sciences de l'ingénieur [physics]/Traitement du signal et de l'image [eess.SP]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-03668771/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03668771/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-03668771/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- ISIT22.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- ISIT22.pdf
- Accès libre
- Accéder au document