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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call