This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design of Efficient Balanced Codes
March 1994 (vol. 43 no. 3)
pp. 362-365

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).

[1] J.M. Berger, "A note on error detection codes for asymmetric channels,"Inform. Contr., vol. 4, pp. 68-73, Mar. 1962.
[2] C.V. Freiman, "Optimal error detection codes for completely asymmetric binary channels,"Inform. Contr., vol. 5, pp. 64-71, Mar. 1962.
[3] D. K. Pradhan,Fault Tolerant Computing: Theory and Techniques. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[4] D.E. Knuth, "Efficient balanced codes,"IEEE Trans. Inform. Theory, vol. IT-32, no. 1, pp. 51-53, Jan. 1986.
[5] B. Bose, "On unordered codes," inInt. Symp. Fault Tolerant Computing, pp. 102-107, July 1987.
[6] S. Al-Bassam and B. Bose, "On balanced codes,"Trans. Inform. Theory, vol. 36, pp. 406-408, Mar. 1990.
[7] N. Alon,et al., "Balancing sets of vectors,"IEEE Trans. Inform. Theory, vol. 34, pp. 128-130, Jan. 1988.
[8] S. Al-Bassam and B. Bose, "Design of efficient error-correcting balanced codes,"IEEE Trans. Comput., vol. 42, no. 10, pp. 1261-1266, Oct. 1993.
[9] R. H. Deng and M. A. Herro, "DC-free coset codes,"IEEE Trans. Inform. Theory, vol. IT-34, pp. 786-792, July 1988.
[10] H. C. Ferreira, "Lower bounds on the minimum Hamming distance achievable with run length constraint or dc free block codes and the synthesis of a (16, 8)dmin= 4,"IEEE Trans. Magn., vol. MAG-34, pp. 881-883, Sept. 1984.
[11] A.X. Widmer and P.A. Franaszek, "A dc-batanced partitioned block, 8B/10B transmission code,"IBM J. Res. Develop., vol. 27, pp. 440-452, Sept. 1983.
[12] Y. Takasakiet al, "Optical pulse formats for fiber optic digital communications,"IEEE Trans. Commun., vol. COM-24, pp. 404-413, 1976.
[13] B. Bose and D. Pradhan, "Optimal unidirectional error correcting/detecting codes,"IEEE Trans. Comput., vol. C-31, pp. 564-568, June 1982.
[14] S. Kundu and S.M. Reddy, "On symmetric error correcting and all unidirectional error detecting codes,"IEEE Trans. Comput., vol. C-39, pp. 752-761, June 1990.
[15] S. Kundu, "Design of nonsystematic 3syEC/AUED codes of asymptotically optimal order,"Int. Symp. Inform. Theory, Jan. 1990.
[16] Y. Saitohet al., "A method to construct constant-weightt-error correcting codes,"Symp. Inform. Theory Appl., Dec. 1988.
[17] J. Riordan,Combinational Identities. New York: Wiley, 1968.
[18] Y. Tohma, R. Sakai, and R. Ohyama, "Realization of fail-safe sequential machines by usingk-out-of-ncodes,"IEEE Trans. Comput., vol. C-20, pp. 1270-1275, Nov. 1971.
[19] D. Pradhan and J. Stiffler, "Error correcting codes and self-checking circuits in fault tolerant computers,"Comput., pp. 27-37, Mar. 1980.

Index Terms:
codes; decoding; encoding; efficient balanced codes; ones; zeros.
Citation:
S. Al-Bassam, B. Bose, "Design of Efficient Balanced Codes," IEEE Transactions on Computers, vol. 43, no. 3, pp. 362-365, March 1994, doi:10.1109/12.272436
Usage of this product signifies your acceptance of the Terms of Use.