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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC) s. 1 - 5
Hlavní autori: Kawasumi, Motohiro, Kasai, Kenta
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2018
Predmet:
Chebyshev approximation
Decoding
Information processing
Iterative algorithms
Iterative decoding
Turbo codes
ISSN:2165-4719
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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