Linear and Non-Linear Run Length Limited Codes

We compare achievable rates of binary linear and non-linear run length limited codes where the constraint is on the number of consecutive ones. We show that there is a significant loss in rate when linear codes are used. For non-linear codes, we present practical encoders with rates close to the theoretical limits. We show that our approach can be generalised to avoid arbitrary sequences in the data stream.