By Topic

Capacity of channels with redundant multitrack (d,k) constraints: the k<d case

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

1 Author(s)
Vasic, B.V. ; Dept. of Electr. Eng., Rochester Inst. of Technol., NY, USA

Run-length-limited or (d,k) recording codes are widely used in digital storage systems with peak detection. The channel capacities of the redundant multitrack (d,k) constraint are calculated and tabulated for k<d. The channel capacities table completes the table obtained by Orcutt and Marcellin (see ibid., vol.39, no.5, p.1744, 1993), who considered the k⩾d case

Published in:

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