Fault-tolerant computing: theory and techniques; vol. 1
Fault-tolerant computing: theory and techniques; vol. 1
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On Symmetric Error Correcting and all Unidirectional Error Detecting Codes
IEEE Transactions on Computers
Design of Efficient Error-Correcting Balanced Codes
IEEE Transactions on Computers
DCm Codes for Constructing t-EC/AUED Codes
IEEE Transactions on Computers
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
Design of Efficient Error-Correcting Balanced Codes
IEEE Transactions on Computers
Efficient Encoding and Decoding Schemes for Balanced Codes
IEEE Transactions on Computers
Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables
IEEE Transactions on Computers
Efficient m-Ary Balanced Codes which Are Invariant under Symbol Permutation
IEEE Transactions on Computers
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
| Hi-index | 15.00 |
All words in a balanced code have equal number of ones and zeros. Denote by DC(n,k) a balanced (or dc-free) code of length n, and 2/sup k/ code words. We design an efficient DC(k+r, k) code with k=2/sup r+1//spl minus/0.8/spl radic/(r/spl minus/2). These codes are optimal up to the construction method, introduced by D.E. Knuth (1986).