DocumentCode
1450190
Title
Knuth´s Balanced Codes Revisited
Author
Weber, Jos H. ; Immink, Kees A Schouhamer
Author_Institution
IRCTR/CWPC, Delft Univ. of Technol., Delft, Netherlands
Volume
56
Issue
4
fYear
2010
fDate
4/1/2010 12:00:00 AM
Firstpage
1673
Lastpage
1679
Abstract
In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of ¿1¿s and ¿-1¿s, called balanced codes. Knuth´s algorithm is well suited for use with large codewords. The redundancy of Knuth´s balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In this paper, we will present results of our attempts to improve the performance of Knuth´s balanced codes.
Keywords
channel capacity; codes; Knuth balanced codes; bipolar codewords; channel capacity; constrained code; magnetic recording; optical recording; Channel capacity; Cryptography; Decoding; Information theory; Magnetic recording; Optical receivers; Optical recording; Turing machines; Ultraviolet sources; Balanced code; channel capacity; constrained code; magnetic recording; optical recording;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2040868
Filename
5437435
Link To Document