By Topic

Coding for channels with cost constraints

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)
A. S. Khayrallah ; Dept. of Electr. Eng., Delaware Univ., Newark, DE, USA ; D. L. Neuhoff

We address the problem of finite-state code construction for the costly channel. This channel model is a generalization of the hard-constrained channel, also known as a subshift. Adler et al. (1986) developed the powerful state-splitting algorithm for use in the construction of finite-state codes for hard-constrained channels. We extend the state-splitting algorithm to the costly channel. We construct synchronous (fixed-length to fixed-length) and asynchronous (variable-length to fixed-length) codes. We present several examples of costly channels related to magnetic recording, the telegraph channel, and shaping gain in modulation. We design a number of codes, some of which come very close to achieving capacity

Published in:

IEEE Transactions on Information Theory  (Volume:42 ,  Issue: 3 )