Efficient \(m\)-ary balanced codes (Q1283068)

This paper, presents new efficient \(m\)-ary balanced code designs which for all values of \(m\geq 2\), improve the redundancy of all the codes mentioned above. To design these codes , the information words which are close to be balanced are encoded using single maps obtained by a new generalization of Knuth's complementation method to the \(m\)-ary alphabet that is introduced here. The resulted codes are efficient that is even from an efficient decodable method and gives an unique implemented encoded-decoded method.