A Message-passing Algorithm Realizing MAP Decoding of Kløve's Permutation Codes
Kløve et al. proposed permutation codes under Chebyshev distance and iterative encoding and decoding algorithms for the permutation code. In this paper, we introduce a factor graph of the decoding problem for the permutation code. On the factor graph, we propose message-passing algorithms for encodi...
Saved in:
| Published in: | 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC) pp. 1 - 5 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.12.2018
|
| Subjects: | |
| ISSN: | 2165-4719 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Kløve et al. proposed permutation codes under Chebyshev distance and iterative encoding and decoding algorithms for the permutation code. In this paper, we introduce a factor graph of the decoding problem for the permutation code. On the factor graph, we propose message-passing algorithms for encoding and decoding. Furthermore, we show that the proposed decoding algorithm realizes optimal MAP decoding while Kløve's decoding is sub-optimal. |
|---|---|
| ISSN: | 2165-4719 |
| DOI: | 10.1109/ISTC.2018.8625268 |