Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929225189031936 |
|---|---|
| author | Usatyuk, Vasiliy Kuznetsov, Yury Egorov, Sergey |
| author_facet | Usatyuk, Vasiliy Kuznetsov, Yury Egorov, Sergey |
| contents | This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to streamline the importance sampling step for estimating the pseudo-codeword weight of Trapping sets. The presented methodology draws on the mathematical framework established in the provided theorem, which elucidates the behavior of projection and lifting transformations on pseudo-codewords |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_14810 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets Usatyuk, Vasiliy Kuznetsov, Yury Egorov, Sergey Information Theory Machine Learning This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to streamline the importance sampling step for estimating the pseudo-codeword weight of Trapping sets. The presented methodology draws on the mathematical framework established in the provided theorem, which elucidates the behavior of projection and lifting transformations on pseudo-codewords |
| title | Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets |
| topic | Information Theory Machine Learning |
| url | https://arxiv.org/abs/2401.14810 |