By Topic

Runlength-limited block codes with small error propagation

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)
Immink, K.A.S. ; Philips Res. Lab., Eindhoven, Netherlands

The principal feature of a (d, k) (or other finite-type constraints) code produced with the sliding-block code algorithm is that the coded sequences can be decoded by examining a limited number of consecutive symbols without relying on external state information. As an immediate consequence, these codes have a limited amount of error propagation. The length of the decoding window is an important design parameter as it affects both the amount of error propagation and decoding hardware. The paper describes the construction of rate m/n (d, k) codes that can be decoded with a sliding-block decoder of window length at most two n-tuples. We furnish sufficient conditions for the construction of such codes. A lower bound to the code size is given. The theory is elucidated by examples of (d,k) codes that require only part of the decoding window

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994