| 摘要 |
Presently known codes have long trains consisting of consecutive 2T runs that reduce the performance of the bit detector. By using a code with an RMTR constraint of 2 an improvement in the bit detection is achieved. A code constructed in a systematic way that provides an RMTR constraint of 2 is presented. Several variations of such a code are disclosed where one or more sub-codes are used, where coding states are divided into coding classes ordered according to more or less stringent constraints on leading bits and where code words are divided into code word types ordered according to more or less stringent constraints on trailing bits. Then, for a given sub-code, an code word of type t can be concatenated with an code word of the next sub-code if said subsequent code word of said next sub-code belongs to one of coding states of the coding class with index T<SUB>max</SUB>+1-t.
|
