Low-complexity algorithm for the minimum distance properties of PAC codes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Low-complexity algorithm for the minimum distance properties of PAC codes

Résumé

In this paper, a low-complexity algorithm that enables to compute the minimum distance as well as its associated number of occurrences for PAC codes is described. The method relies on the computation of the minimum weight properties of polar cosets while taking into consideration the initial precoding. Due to the exponential rise of the number of cosets, we propose a method that discards the cosets that have no impact on the computation of the minimum distance. This method does not impose any specific rules on the choice of the frozen bit set and the initial precoding.
Fichier principal
Vignette du fichier
a6-ellouze final.pdf (403.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04289436 , version 1 (17-11-2023)

Identifiants

  • HAL Id : hal-04289436 , version 1

Citer

Malek Ellouze, Romain Tajan, Camille Leroux, Christophe Jégo, Charly Poulliat. Low-complexity algorithm for the minimum distance properties of PAC codes. International Symposium on Topics in Coding (ISTC), Sep 2023, Brest, France. ⟨hal-04289436⟩
15 Consultations
34 Téléchargements

Partager

Gmail Facebook X LinkedIn More