Very Efficient Balanced Codes

The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a factor of two short with respect to the minimum required. We present a new constructi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2010-02, Vol.28 (2), p.188-192
Main Authors: Schouhamer Immink, Kees A., Weber, Jos H.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
balanced code
Balancing
Channel capacity
Communication channels
constrained code
Construction
Cryptography
dc-free code
Decoding
Information retrieval
Magnetic recording
Optical recording
Redundancy
Redundant
Segments
Symbols
Table lookup
Tables
Turing machines
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated by Knuth's algorithm falls a factor of two short with respect to the minimum required. We present a new construction, which is simple, does not use look-up tables, and is less redundant than Knuth's construction. In the new construction, the user word is modified in the same way as in Knuth's construction, that is by inverting a segment of user symbols. The prefix that indicates which segment has been inverted, however, is encoded in a different, more efficient, way.
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2010.100207