By Topic

Simple Classes of Constrained Systems With Unconstrained Positions That Outperform the Maxentropic Bound

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
$33 $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)
Kees A. Schouhamer Immink ; Turing Machines Inc., Rotterdam ; Kui Cai

The Wijngaarden-Immink (WI) scheme is a combined modulation/ECC coding scheme, where arbitrary user data are translated into a constrained sequence in which predefined positions are reserved for error-correcting codes (ECC) parity. Besides offering the benefit of combined modulation/ECC coding, the WI scheme has two extra benefits. They are (a) error propagation is limited to the constrained symbols, since symbols on the unconstrained positions are not related, and (b) code hardware is limited to a lookup table of the coded part. We will describe classes of simple bit-stuffing schemes that require less redundancy than predicted by the bound based on the performance of maxentropic constrained systems presented by Campello and Poo.

Published in:

IEEE Transactions on Information Theory  (Volume:55 ,  Issue: 5 )