Efficient Encoding and Decoding Schemes for Balanced Codes

In this paper, we introduce two encoding and decoding methods for balanced codes. The proposed methods are more efficient in terms of computational complexity. The first one complements several appropriate bits at a time instead of complementing one bit at a time as done in Knuth's method. The second one is a parallel implementation of Knuth's method.