Conference Paper

On error propagation assessment of high rate runlength-limited codes

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

A framework for the analysis of error propagation for high rate runlength-limited codes is developed. The susceptibility to errors of capacity approaching code constructions, the enumerative and sequence replacement technique and bit stuffing, are analyzed in detail. It is shown that the first two techniques experience low error propagation and that they are superior to the popular bit-stuffing technique.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Conference Paper
Full-text available
General construction methods of prefix synchronized codes and runlength limited codes are presented, which make use of so-called sequence replacement techniques. These techniques provide a simple and efficient conversion of data words into codewords of a constrained block-code, where subsequences violating the imposed constraints are replaced by encoded information to indicate their relative positions in the data word. Several constructions are proposed for constrained codes with low error propagation, and for variable length constrained codes. The coding algorithms have a low computational and hardware complexity. The rate of the constructed codes approaches the theoretical maximum. It is feasible to apply these high rate constrained block codes in communication and recording systems
Codes for Mass Data Storage Systems, Shan-non Foundation Publishers, The Netherlands
  • K A S Immink
K. A. S. Immink, Codes for Mass Data Storage Systems, Shan-non Foundation Publishers, The Netherlands, 1999.