HP Labs Technical Reports
Click here for full text:
Nested Block Decodable Runlength Limited Codes
Hogan, Josh; Roth, Ron M.; Ruckenstein, Gitit
Keyword(s): block decodable encoders; deterministic encoders; nested encoders; runlength-limited constraints
Abstract: Consider a (d(subscript 1), k(subscript 1))-RLL constraint that is contained in a (d(subscript 2), k(subscript 2)-RLL constraint, where k(subscript 1) >2d(subscript 1) and d(subscript 2) > 0, and fix a codeword length q> k(subscript 2). It is shown that whenever there exist block decodable encoders with codeword length q for those two constraints, there exist such encoders where one is a subgraph of the other; furthermore, both encoders can be decoded by essentially the same decoder. Specifically , a (d(subscript 1),k(subscript 1)-RLL constrained word is decoded by first using a block decoder of the (d(subscript 2,k(subscript 2)-RLL encoder, and then applying a certain function to the output of that decoder. Notes: This abstract contains formulae which cannot be accurately reproduced here.
Back to Index