Patent ID: 7142133

Claim:
A method of arranging m-bit source data into n-bit, where n≧m, and n and m are positive integers, code words by confining a minimum run length limit to “d” and a maximum run length limit to “k”, where “d” and “k” are positive integers, the method comprising: when a code word “a” is connected to a code word “b”, the code word “a” is a preceding code word, the code word “b” is selected from code words “b 1 ” and “b 2 ”, a code stream in which the code word “a” is connected to the code word “b 1 ” is X 1 , and a code stream in which the code word “a” is connected to the code word “b 2 ” is X 2 , arranging the code words “b 1 ” and “b 2 ” to have opposite parameters INV predicting a transition of a next code word depending on whether a number of bits of value “1” in a code word is odd or even; and when the code word “a” is connected to the code word “b 1 ” or “b 2 ”, although the code word “a”, “b 1 ” or “b 2 ” is modulated into another type of code word according to a boundary rule, arranging the code streams X 1 and X 2 to have opposite parameters INV.