Low-Complexity Algorithm for the Minimum Distance Properties of PAC Codes - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

Low-Complexity Algorithm for the Minimum Distance Properties of PAC Codes

Abstract

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.
No file

Dates and versions

hal-04261670 , version 1 (27-10-2023)

Identifiers

Cite

Malek Ellouze, Romain Tajan, Camille Leroux, Christophe Jégo, Charly Poulliat. Low-Complexity Algorithm for the Minimum Distance Properties of PAC Codes. 12th International Symposium on Topics in Coding (ISTC 2023), Sep 2023, Brest, France. pp.1-5, ⟨10.1109/ISTC57237.2023.10273572⟩. ⟨hal-04261670⟩
15 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More