#### Filter Results:

#### Publication Year

2000

2001

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

An input-constrained channel, or simply a constraint, is a set of S of words that is generated by a finite labeled directed graph. In the context of coding, the study of constraints mainly aims at designing encoders that map unconstrained input words into words of S in a lossless manner. In most applications, the encoders are finite-state machines that map… (More)

Consider a (d 1 k 1)-RLL constraint that is contained in a (d 2 k 2)-RLL constraint , where k 1 2d 1 and d 2 > 0, and x a codeword length q > k 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 otherr furthermore, both encoders can be… (More)

- ‹
- 1
- ›