Efficient decoding algorithm for constant composition codes

Author

Chang, Jen-Chun ; Tsai, I-Te ; Wu, Hsin-Lung

Author_Institution

Dept. of Comput. Sci. & Inf. Eng., Nat. Taipei Univ., Taipei, Taiwan

fYear

2010

fDate

17-20 Oct. 2010

Firstpage

278

Lastpage

281

Abstract

Constant composition codes arise from applications in powerline communication and balanced scheduling in frequency hopping. Binary constant weight codes and permutation codes are special types of constant composition codes. In ISIT 2009, Chang and Wu proposed a method to construct constant composition codes through distance-increasing mappings from binary vectors to quaternary constant composition vectors. But they did not touch the decoding problem. In this paper, we present efficient decoding algorithms for the constant composition codes generated from distance-increasing (or distance-preserving) mappings.

Keywords

binary codes; carrier transmission on power lines; decoding; frequency hop communication; balanced scheduling; binary constant weight code; binary vector; constant composition code; decoding algorithm; distance-increasing mapping; frequency hopping; permutation code; powerline communication; quaternary constant composition vector; Binary codes; Complexity theory; Decoding; Encoding; Hamming distance; Vectors; Zinc; constant composition code; constant weight code; decodings; distance-increasing mapping; permutation code;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory and its Applications (ISITA), 2010 International Symposium on

Conference_Location

Taichung

Print_ISBN

978-1-4244-6016-8

Electronic_ISBN

978-1-4244-6017-5

Type

conf

DOI

10.1109/ISITA.2010.5648975

Filename

5648975