1989
DOI: 10.1109/18.45295
|View full text |Cite
|
Sign up to set email alerts
|

A general error-correcting code construction for run-length limited binary channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
21
0

Year Published

1991
1991
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(24 citation statements)
references
References 10 publications
0
21
0
Order By: Relevance
“…Deeper analysis and explanation of this technique and its connection with standard practice in line coding area (namely selecting codewords from more dictionaries using running disparity) was published in [4]. In [5] and [6] construction of EC-RLL trellis codes and general method for single error correcting EC-RLL codes were presented respectively. In [7] it was proposed to modify a linear error control block code into Transcontrol code without introduction of additional redundant symbols.…”
Section: Introductionmentioning
confidence: 99%
“…Deeper analysis and explanation of this technique and its connection with standard practice in line coding area (namely selecting codewords from more dictionaries using running disparity) was published in [4]. In [5] and [6] construction of EC-RLL trellis codes and general method for single error correcting EC-RLL codes were presented respectively. In [7] it was proposed to modify a linear error control block code into Transcontrol code without introduction of additional redundant symbols.…”
Section: Introductionmentioning
confidence: 99%
“…In [4] trellis RLL-ECCs were constructed. In [5] a RLL-ECC for one error correction was proposed. In [6] a systematic approach was given for obtaining RLL-ECCs from binary error-correcting codes.…”
Section: Introductionmentioning
confidence: 99%
“…Their error detection capability is limited to the codewords non-supported by the code, as well as to the weak constraint of k, I violations. Furthermore, the block mapping size grows exponentially with the user data word length N. Concatenation of conventional RLL codes with ECC can reduce the effectiveness of the ECC, especially with a sliding block encoder/decoder subject to error propagation [3]. The single-error correcting RLL codes combine RLL with single-error correcting capability via an increase of the codewords' minimum distance d min , but with the adverse effect of a lower rate, such as 8/21, 8/28 [3], or 1/3 and 7/17 [4].…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, the block mapping size grows exponentially with the user data word length N. Concatenation of conventional RLL codes with ECC can reduce the effectiveness of the ECC, especially with a sliding block encoder/decoder subject to error propagation [3]. The single-error correcting RLL codes combine RLL with single-error correcting capability via an increase of the codewords' minimum distance d min , but with the adverse effect of a lower rate, such as 8/21, 8/28 [3], or 1/3 and 7/17 [4]. In [5], it was proposed that the Hamming subcode block length is kept as large as possible to avoid rate loss for a single-error correcting ECC/RLL code.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation