## Maximum Runlength-Limited Codes with Error Control Capabilities (2001)

Venue: | IEEE J. Select. Areas Commun |

Citations: | 20 - 5 self |

### BibTeX

@ARTICLE{Wijngaarden01maximumrunlength-limited,

author = {Adriaan J. Van Wijngaarden and Kees A. Schouhamer Immink},

title = {Maximum Runlength-Limited Codes with Error Control Capabilities},

journal = {IEEE J. Select. Areas Commun},

year = {2001},

volume = {19},

pages = {602--611}

}

### OpenURL

### Abstract

New methods are presented to protect maximum runlength-limited sequences against random and burst errors and to avoid error propagation. The methods employ parallel conversion techniques and enumerative coding algorithms that transform binary user information into constrained codewords. The new schemes have a low complexity and are very efficient. The approach can be used for modulation coding in recording systems and for synchronization and line coding in communication systems. The schemes enable the usage of high-rate constrained codes, as error control can be provided with similar capabilities as for unconstrained sequences. Index Terms---Burst correction codes, enumerative coding, forward error correction, modulation coding, Reed--Solomon codes, runlength codes, synchronization. I.

### Citations

1859 |
Data networks
- Bertsekas, Galagher
(Show Context)
Citation Context ...The rate is typically 8/9 and sometimes 16/17. The introduction of higher rate codes is hampered by the coding complexity, latency, and error propagation. In data networks, the bit-stuffing procedure =-=[6]-=- is widely employed. The drawbacks of this method are the data-dependent codeword length and error propagation [7]. Recently, algorithmic conversion methods based on enumeration [3], [8], [9] and on t... |

60 |
Enumerative source encoding
- Cover
- 1973
(Show Context)
Citation Context ...rocedure [6] is widely employed. The drawbacks of this method are the data-dependent codeword length and error propagation [7]. Recently, algorithmic conversion methods based on enumeration [3], [8], =-=[9]-=- and on the sequence replacement technique [10], [11] have been proposed. These algorithms have a computational complexity proportional to the length of the codewords and attain the achievable rate fo... |

56 |
Costello Jr., Error Control Coding: Fundamentals and Applications
- Lin, J
- 1983
(Show Context)
Citation Context ... to convert user information into a constrained sequence, preferably by using a very efficient coding algorithm [11], [12], and to protect the resulting sequence using a systematic error control code =-=[13]-=-. We present special techniques to add the error control information, i.e., the parity check bits, without violating the imposed constraints. In Section II, we describe the properties of MRL sequences... |

48 |
Coding Techniques for Digital Recorders
- Immink
(Show Context)
Citation Context ...M runlength-limited sequences have the property that long runs of consecutive like symbols do not occur. Maximum runlength-limited codes, in short, MRL codes, are equivalent to codes in NRZI notation =-=[1]. A code is a se-=-t of binary sequences (codewords) with the property that at least 0 and at most “zeros” occur between two consecutive “ones.” In NRZI, a “one” corresponds to a reversal and a “zero” to... |

36 |
Fibonacci codes for synchronization control
- Kautz
- 1965
(Show Context)
Citation Context ...ing procedure [6] is widely employed. The drawbacks of this method are the data-dependent codeword length and error propagation [7]. Recently, algorithmic conversion methods based on enumeration [3], =-=[8]-=-, [9] and on the sequence replacement technique [10], [11] have been proposed. These algorithms have a computational complexity proportional to the length of the codewords and attain the achievable ra... |

34 | A practical method for approaching the channel capacity of constrained channels
- Immink
- 1997
(Show Context)
Citation Context ... we use existing constrained coding algorithms and error control codes. We propose to convert user information into a constrained sequence, preferably by using a very efficient coding algorithm [11], =-=[12]-=-, and to protect the resulting sequence using a systematic error control code [13]. We present special techniques to add the error control information, i.e., the parity check bits, without violating t... |

25 |
Immink, Codes for Mass Data Storage Systems. Shannon Foundation
- S
- 2004
(Show Context)
Citation Context ...or , satisfies the recursion relation It follows that the cardinality of the set , denoted by and , is determined by two equations Coding algorithms based on enumeration can be directly applied [12], =-=[15]. -=-3) Constrained and Unconstrained Positions: Consider a code . The positions of the sequence if if if (1) (2) (3) (4) Fig. 1. Block diagram of a CC–EC scheme. that determine whether is an element of ... |

20 |
Circuitry for performing error correction calculations on baseband encoded data to eliminate error propagation
- Bliss
- 1981
(Show Context)
Citation Context ...that we will consider is a three-step constrained coding and error control coding scheme. The block diagram of this scheme, which is shown in Fig. 2, is similar to the schemes proposed in [12], [15], =-=[18]��-=-�[20], and references therein, but by applying this scheme for the protection of codes, important modifications can be made. This scheme converts source words into constrained codewords in three succe... |

16 |
Modulation and coding for information storage
- Siegel, Wolf
- 1991
(Show Context)
Citation Context ...d a “zero” to a nonreversal of the polarization in a binary differential signaling scheme. The parameter defines the maximum distance between transitions. The codes are used in recording systems [=-=1], [2]-=- and in digital communications systems as line codes for clock recovery or to align fixed and variable length data packets, also known as frame synchronization. Frame synchronization can be achieved b... |

13 | A modified concatenated coding scheme, with applications to magnetic storage
- Fan, Calderbank
- 1998
(Show Context)
Citation Context ...we will consider is a three-step constrained coding and error control coding scheme. The block diagram of this scheme, which is shown in Fig. 2, is similar to the schemes proposed in [12], [15], [18]�=-=��[20]-=-, and references therein, but by applying this scheme for the protection of codes, important modifications can be made. This scheme converts source words into constrained codewords in three successive... |

12 | A.J.H.: On the construction of maximal prefixsynchronized codes - Morita, Wijngaarden, et al. - 1996 |

11 |
Magnetic Recording
- Mee, Daniel
- 1996
(Show Context)
Citation Context ... S 0733-8716(01)01754-1. 0733–8716/01$10.00 © 2001 IEEE leading and trailing zeros of a codeword ( ). In practice, codes are often constructed with look-up tables or combinatorial circuitry [1], [2=-=], [4]-=-, [5]. The rate is typically 8/9 and sometimes 16/17. The introduction of higher rate codes is hampered by the coding complexity, latency, and error propagation. In data networks, the bit-stuffing pro... |

7 | Immink, “Combinatorial construction of high rate runlength-limited codes
- Wijngaarden, S
- 1996
(Show Context)
Citation Context ... into a codeword of a constrained sequence of length , where , , and . This codeword is protected by a systematic error control code. The parity bits are inserted in the codeword in a specific manner =-=[21], -=-such that the resulting sequence (5) (6)sVAN WIJNGAARDEN AND SCHOUHAMER IMMINK: MRL CODES WITH ERROR CONTROL 605 Fig. 3. Block diagram of CC–EC Scheme II, a two-step modulation and error control cod... |

5 |
Method and apparatus for implementing optimum PRML codes,” U.S. Patent 4,707,681
- Eggenberger, Patel
(Show Context)
Citation Context ... more difficult than is the construction of a code, because both the global constraints and the constraints on the interleaved sequences of elements with odd and even indices have to be fulfilled. In =-=[23], -=-a combinatorial construction of a rate 8/9, (0, 4/4) code and a rate 8/9, (0, 3/6) code have been presented, and in [14], [21], and [24], a rate 16/17, (0, 6/6) code has been presented. The CC–EC sc... |

4 |
A combinatorial technique for constructing high rate MTR–RLL codes
- Wijngaarden, Soljanin
(Show Context)
Citation Context ...33-8716(01)01754-1. 0733–8716/01$10.00 © 2001 IEEE leading and trailing zeros of a codeword ( ). In practice, codes are often constructed with look-up tables or combinatorial circuitry [1], [2], [4=-=], [5]-=-. The rate is typically 8/9 and sometimes 16/17. The introduction of higher rate codes is hampered by the coding complexity, latency, and error propagation. In data networks, the bit-stuffing procedur... |

3 |
Constrained block codes for class-iv partial-response channels with maximum likelihood sequence estimation
- Abdel-Ghaffar, Weber
- 1996
(Show Context)
Citation Context ...hannels with a impulse response, also known as PRML channels, to aid timing and gain recovery and simplify the design of the Viterbi detector for the PRML channel [2]. The construction of a code [2], =-=[22]-=- is in general more difficult than is the construction of a code, because both the global constraints and the constraints on the interleaved sequences of elements with odd and even indices have to be ... |

2 |
On the construction of constrained codes employing sequence replacement techniques
- Wijngaarden, Immink
- 1997
(Show Context)
Citation Context ... of this method are the data-dependent codeword length and error propagation [7]. Recently, algorithmic conversion methods based on enumeration [3], [8], [9] and on the sequence replacement technique =-=[10]-=-, [11] have been proposed. These algorithms have a computational complexity proportional to the length of the codewords and attain the achievable rate for the given constraints. The codes are usually ... |

2 |
Magnetic Storage Handbook
- Mee, Daniel
- 1996
(Show Context)
Citation Context ...ts to facilitate error control. In Section V, we propose several combinatorial constructions of specific high-rate constrained codes. In Section VI, the methods are applied to the class of codes [2], =-=[14]-=-, which fulfill global constraints as well as constraints for the two interleaved subsequences of elements with odd and even indexes, respectively. The codes arise in the context of coding for channel... |

2 |
Analysis of coding schemes for modulation and error control
- Abdel-Ghaffar, Blaum, et al.
- 1995
(Show Context)
Citation Context ...he typical approach employed in recording and communication systems, where every source word is encoded into a codeword of an error control code and successively converted into a constrained sequence =-=[16]-=-. At the receiver, the constrained sequence must be decoded first, and the resulting decoded sequence is checked for the presence of errors using the error control code. A major disadvantage of these ... |

1 |
Wijngaarden, “On combined synchronization and error control coding
- Kabatjanskii, Vinck, et al.
- 1994
(Show Context)
Citation Context ...plexity, latency, and error propagation. In data networks, the bit-stuffing procedure [6] is widely employed. The drawbacks of this method are the data-dependent codeword length and error propagation =-=[7]-=-. Recently, algorithmic conversion methods based on enumeration [3], [8], [9] and on the sequence replacement technique [10], [11] have been proposed. These algorithms have a computational complexity ... |

1 |
Improved encoder and decoder for a byte-oriented (0
- Patel
- 1985
(Show Context)
Citation Context ... than to correct random errors. The EC–CC scheme requires the wordlength of the constrained code to be small to restrict error propagation. Typical block codes such as the rate 8/9, (0, 3, 1, 2) cod=-=e [17]-=- convert 8-bit source words into nine-bit codewords using a look-up table or a combinatorial circuit consisting of a few logic gates. In this case, error propagation is limited to one byte, and this a... |

1 | Method and apparatus for implementing post-modulation error correction coding scheme,” U.S. Patent 5,311,521 - Fitingof, Mansuripur - 1994 |

1 |
Rate 16/17 (0,6/6) code,” IBM
- Patel
- 1998
(Show Context)
Citation Context ...f elements with odd and even indices have to be fulfilled. In [23], a combinatorial construction of a rate 8/9, (0, 4/4) code and a rate 8/9, (0, 3/6) code have been presented, and in [14], [21], and =-=[24], -=-a rate 16/17, (0, 6/6) code has been presented. The CC–EC schemes can be employed to efficiently protect codes. Interleaving can be used to obtain high-rate codes. Interleaving is done by inserting ... |