DocumentCode :
1535825
Title :
High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement
Author :
Immink, Kees A Schouhamer
Author_Institution :
Turing Machines Inc., Rotterdam, Netherlands
Volume :
58
Issue :
10
fYear :
2012
Firstpage :
6572
Lastpage :
6580
Abstract :
In this paper, we will present coding techniques for the character-constrained channel, where information is conveyed using q-bit characters (nibbles), and where w prescribed characters are disallowed. Using codes for the character-constrained channel, we present simple and systematic constructions of high-rate binary maximum runlength constrained codes. The new constructions have the virtue that large lookup tables for encoding and decoding are not required. We will compare the error propagation performance of codes based on the new construction with that of prior art codes.
Keywords :
channel coding; decoding; table lookup; channel coding; character constrained channel; decoding are; error propagation performance; lookup tables; maximum runlength constrained coding schemes; nibble replacement; Art; Complexity theory; Decoding; Encoding; Error correction codes; Redundancy; Table lookup; Constrained code; recording; runlength limited code;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2012.2204034
Filename :
6214603
Link To Document :
بازگشت