By Topic

Design of efficient balanced codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Al-Bassam, S. ; Dept. of Comput. Sci., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia ; Bose, B.

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 2k code words. We design an efficient DC(k+r, k) code with k=2r+1-0.8√(r-2). These codes are optimal up to the construction method, introduced by D.E. Knuth (1986)

Published in:

Computers, IEEE Transactions on  (Volume:43 ,  Issue: 3 )