DocumentCode
937058
Title
A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
Author
Beenker, F.M. ; Immink, K. A Schouhamer
Volume
29
Issue
5
fYear
1983
fDate
9/1/1983 12:00:00 AM
Firstpage
751
Lastpage
754
Abstract
Many modulation systems used in magnetic and optical recording are based on binary run-length-limited codes. We generalize the concept of
-limited sequences of length n introduced by Tang and Bald by imposing constraints on the maximum number of consecutive zeros at the beginning and the end of the sequences. It is shown that the encoding and decoding procedures are similar to those of Tang and Bald. The additional constraints allow a more efficient merging of the sequences. We demonstrate two constructions of run-length-limited codes with merging rules of increasing complexity and efficiency and compare them to Tang and Bahl\´s method.
-limited sequences of length n introduced by Tang and Bald by imposing constraints on the maximum number of consecutive zeros at the beginning and the end of the sequences. It is shown that the encoding and decoding procedures are similar to those of Tang and Bald. The additional constraints allow a more efficient merging of the sequences. We demonstrate two constructions of run-length-limited codes with merging rules of increasing complexity and efficiency and compare them to Tang and Bahl\´s method.Keywords
Magnetic recording; Optical recording; Run-length coding; Binary sequences; Convolutional codes; Decoding; Encoding; Magnetic modulators; Merging; Propulsion; Space technology; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1983.1056728
Filename
1056728
Link To Document