ptpc
An algorithm for enumerating the minimum weight codewords of pre-transformed polar codes.
Science Score: 67.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
✓DOI references
Found 2 DOI reference(s) in README -
✓Academic publication links
Links to: arxiv.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (9.1%) to scientific vocabulary
Keywords
Repository
An algorithm for enumerating the minimum weight codewords of pre-transformed polar codes.
Basic Info
Statistics
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
- Releases: 0
Topics
Metadata Files
README.md
Enumeration of Minimum Weight Codewords of Pre‑Transformed Polar Codes by Tree Intersection
This is a C source file for enumerating the minimum weight codewords of pre-transformed polar codes (PTPCs).
Overview
Pre-transformation can improve the distance properties polar codes by reducing the number of minimum weight codewords and/or increasing the minimum distance. PTPCs can be split into disjoint cosets whereby the number of minimum weight codewords can be determined by counting their number in each coset.
The implemented method uses the explicit construction of the messages that generate the minimum weight codewords of "universal" polar cosets introduced in [1]. A coset of a PTPC is always contained in the corresponding "universal" polar coset. Consequently, the minimum weight codewords in a coset of a PTPC can be found by computing the intersection with the set of minimum weight codewords in the corresponding "universal" polar coset. The algorithm efficiently counts the number of minimum weight codewords by traversing the intersection tree of the messages that form the two codeword sets.
Please note that this method cannot find the number of minimum weight codewords if the pre-transformation increases the minimum distance of the polar code.
Further information on the algorithm can be found in the following paper: https://arxiv.org/abs/2311.17774
Usage
enumeration.c gives a simple example for counting the minimum weight codewords of a PAC code.
Compile with:
gcc -march=native -Ofast -o enumeration enumeration.c
The code was tested on an Intel® Core™ i7-4790K CPU @ 4.00GHz.
Citing
Please cite the following reference if you want to use this algorithm in your research:
bibtex
@INPROCEEDINGS{10480163,
author={Zunker, Andreas and Geiselhart, Marvin and Ten Brink, Stephan},
booktitle={2024 58th Annual Conference on Information Sciences and Systems (CISS)},
title={Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection},
year={2024},
doi={10.1109/CISS59072.2024.10480163}}
References
[1] M. Rowshan, S. H. Dau and E. Viterbo, "On the Formation of Min-Weight Codewords of Polar/PAC Codes and Its Applications," in IEEE Transactions on Information Theory, vol. 69, no. 12, pp. 7627-7649, Dec. 2023, doi: 10.1109/TIT.2023.3319015.
Owner
- Name: Andreas Zunker
- Login: andreaszunker
- Kind: user
- Repositories: 1
- Profile: https://github.com/andreaszunker
Citation (CITATION.cff)
cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
- family-names: "Zunker"
given-names: "Andreas"
title: "Enumeration of Minimum Weight Codewords of Pre‑Transformed Polar Codes by Tree Intersection"
date-released: 2024-04-02
url: "https://github.com/andreaszunker/PTPC"
preferred-citation:
type: article
authors:
- family-names: "Zunker"
given-names: "Andreas"
- family-names: "Geiselhart"
given-names: "Marvin"
orcid: "https://orcid.org/0000-0001-9055-619X"
- family-names: "ten Brink"
given-names: "Stephan"
orcid: "https://orcid.org/0000-0003-1502-2571"
doi: "10.1109/CISS59072.2024.10480163"
title: "Enumeration of Minimum Weight Codewords of Pre‑Transformed Polar Codes by Tree Intersection"
year: 2024
month: 04
booktitle: "2024 58th Annual Conference on Information Sciences and Systems (CISS)"
url: "https://ieeexplore.ieee.org/document/10480163"
publisher:
name: "IEEE"
GitHub Events
Total
- Watch event: 2
- Push event: 6
Last Year
- Watch event: 2
- Push event: 6