Efficient decoding algorithm for cyclically permutable code

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

When a sender side and a receiver side are not synchronized, it is difficult to correctly decode a received codeword. In this study, we investigate a Cyclically Permutable Code (CPC) to immunize the synchronization loss as well as an additive noise over a communication channel. A cyclic code retains the characteristic that cyclically shifted codewords belong to the same code. The codewords in cyclic code can form small cyclic groups such that all codeword in each group is a cyclically shifted version of a certain codeword. The CPC encoder selects each one codeword in each group. Even if a received codeword is cyclically shifted from an original codeword, the receiver can identify the group to which the original codeword belongs. Although there are some methods to generate CPC, the decoding method has not been discussed. Considering the algebraic property of CPC, an efficient decoding method is proposed in this study. The validity of the proposed method is evaluated by simulation.

Original languageEnglish
Title of host publication2018 IEEE Information Theory Workshop, ITW 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538635995
DOIs
Publication statusPublished - Jan 15 2019
Event2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China
Duration: Nov 25 2018Nov 29 2018

Publication series

Name2018 IEEE Information Theory Workshop, ITW 2018

Conference

Conference2018 IEEE Information Theory Workshop, ITW 2018
CountryChina
CityGuangzhou
Period11/25/1811/29/18

Fingerprint

Decoding
Additive noise
Synchronization

ASJC Scopus subject areas

  • Information Systems

Cite this

Kuribayashi, M., Suma, S., & Funabiki, N. (2019). Efficient decoding algorithm for cyclically permutable code. In 2018 IEEE Information Theory Workshop, ITW 2018 [8613319] (2018 IEEE Information Theory Workshop, ITW 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2018.8613319

Efficient decoding algorithm for cyclically permutable code. / Kuribayashi, Minoru; Suma, Shodai; Funabiki, Nobuo.

2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2019. 8613319 (2018 IEEE Information Theory Workshop, ITW 2018).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kuribayashi, M, Suma, S & Funabiki, N 2019, Efficient decoding algorithm for cyclically permutable code. in 2018 IEEE Information Theory Workshop, ITW 2018., 8613319, 2018 IEEE Information Theory Workshop, ITW 2018, Institute of Electrical and Electronics Engineers Inc., 2018 IEEE Information Theory Workshop, ITW 2018, Guangzhou, China, 11/25/18. https://doi.org/10.1109/ITW.2018.8613319
Kuribayashi M, Suma S, Funabiki N. Efficient decoding algorithm for cyclically permutable code. In 2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc. 2019. 8613319. (2018 IEEE Information Theory Workshop, ITW 2018). https://doi.org/10.1109/ITW.2018.8613319
Kuribayashi, Minoru ; Suma, Shodai ; Funabiki, Nobuo. / Efficient decoding algorithm for cyclically permutable code. 2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2019. (2018 IEEE Information Theory Workshop, ITW 2018).
@inproceedings{25166e2131ef4a6b94eb33852c51b954,
title = "Efficient decoding algorithm for cyclically permutable code",
abstract = "When a sender side and a receiver side are not synchronized, it is difficult to correctly decode a received codeword. In this study, we investigate a Cyclically Permutable Code (CPC) to immunize the synchronization loss as well as an additive noise over a communication channel. A cyclic code retains the characteristic that cyclically shifted codewords belong to the same code. The codewords in cyclic code can form small cyclic groups such that all codeword in each group is a cyclically shifted version of a certain codeword. The CPC encoder selects each one codeword in each group. Even if a received codeword is cyclically shifted from an original codeword, the receiver can identify the group to which the original codeword belongs. Although there are some methods to generate CPC, the decoding method has not been discussed. Considering the algebraic property of CPC, an efficient decoding method is proposed in this study. The validity of the proposed method is evaluated by simulation.",
author = "Minoru Kuribayashi and Shodai Suma and Nobuo Funabiki",
year = "2019",
month = "1",
day = "15",
doi = "10.1109/ITW.2018.8613319",
language = "English",
series = "2018 IEEE Information Theory Workshop, ITW 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE Information Theory Workshop, ITW 2018",

}

TY - GEN

T1 - Efficient decoding algorithm for cyclically permutable code

AU - Kuribayashi, Minoru

AU - Suma, Shodai

AU - Funabiki, Nobuo

PY - 2019/1/15

Y1 - 2019/1/15

N2 - When a sender side and a receiver side are not synchronized, it is difficult to correctly decode a received codeword. In this study, we investigate a Cyclically Permutable Code (CPC) to immunize the synchronization loss as well as an additive noise over a communication channel. A cyclic code retains the characteristic that cyclically shifted codewords belong to the same code. The codewords in cyclic code can form small cyclic groups such that all codeword in each group is a cyclically shifted version of a certain codeword. The CPC encoder selects each one codeword in each group. Even if a received codeword is cyclically shifted from an original codeword, the receiver can identify the group to which the original codeword belongs. Although there are some methods to generate CPC, the decoding method has not been discussed. Considering the algebraic property of CPC, an efficient decoding method is proposed in this study. The validity of the proposed method is evaluated by simulation.

AB - When a sender side and a receiver side are not synchronized, it is difficult to correctly decode a received codeword. In this study, we investigate a Cyclically Permutable Code (CPC) to immunize the synchronization loss as well as an additive noise over a communication channel. A cyclic code retains the characteristic that cyclically shifted codewords belong to the same code. The codewords in cyclic code can form small cyclic groups such that all codeword in each group is a cyclically shifted version of a certain codeword. The CPC encoder selects each one codeword in each group. Even if a received codeword is cyclically shifted from an original codeword, the receiver can identify the group to which the original codeword belongs. Although there are some methods to generate CPC, the decoding method has not been discussed. Considering the algebraic property of CPC, an efficient decoding method is proposed in this study. The validity of the proposed method is evaluated by simulation.

UR - http://www.scopus.com/inward/record.url?scp=85062059530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062059530&partnerID=8YFLogxK

U2 - 10.1109/ITW.2018.8613319

DO - 10.1109/ITW.2018.8613319

M3 - Conference contribution

AN - SCOPUS:85062059530

T3 - 2018 IEEE Information Theory Workshop, ITW 2018

BT - 2018 IEEE Information Theory Workshop, ITW 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -