String concatenation construction for Chebyshev permutation channel codes
Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Xiande Zhang · 2016
We construct codes for the Chebyshev permutation channels whose study was initiated by Langberg et al. (2015). We establish several recursive code constructions and present efficient decoding algorithms for our codes. In particular, our constructions yield a family of binary codes of rate 0.643 when r = 1. The upper bound on the rate in this case is 2/3 and the previous highest rate is 0.609.