Efficient decoding algorithm for cyclically permutable code

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

1 Citation (Scopus)


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


Conference2018 IEEE Information Theory Workshop, ITW 2018

ASJC Scopus subject areas

  • Information Systems


Dive into the research topics of 'Efficient decoding algorithm for cyclically permutable code'. Together they form a unique fingerprint.

Cite this