Design of Balanced and Constant Weight Codes for VLSI Systems
IEEE Transactions on Computers
Balanced Codes with Parallel Encoding and Decoding
IEEE Transactions on Computers
Efficient Encoding and Decoding Schemes for Balanced Codes
IEEE Transactions on Computers
Simple balanced codes that approach capacity
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Efficient balancing of q-ary sequences with parallel decoding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
IEEE Journal on Selected Areas in Communications
Knuth's balanced codes revisited
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
A balanced code with r check bits and k information bits is a binary code of length k+r and cardinality 2k such that each codeword is balanced; that is, it has [(k+r)/2] 1's and [(k+r)/2] 0's. This paper contains new methods to construct efficient balanced codes. To design a balanced code, an information word with a low number of 1's or 0's is compressed and then balanced using the saved space. On the other hand, an information word having almost the same number of 1's and 0's is encoded using the single maps defined by Knuth's (1986) complementation method. Three different constructions are presented. Balanced codes with r check bits and k information bits with k⩽2r+1-2, k⩽3×2r-8, and k⩽5×2r-10r+c(r), c(r)∈{-15, -10, -5, 0, +5}, are given, improving the constructions found in the literature. In some cases, the first two constructions have a parallel coding scheme