Title :
On the number of encoder states of a type of RLL codes
Author :
Cai, Kui ; Immink, Kees A Schouhamer
Author_Institution :
Data Storage Inst., Nat. Univ. of Singapore, Singapore
fDate :
7/1/2006 12:00:00 AM
Abstract :
The relationship between the number of encoder states and the probable size of certain runlength-limited (RLL) codes is derived analytically. By associating the number of encoder states with (generalized) Fibonacci numbers, the minimum number of encoder states is obtained, which maximizes the rate of the designed code, irrespective of the codeword length.
Keywords :
Fibonacci sequences; runlength codes; Fibonacci number; RLL code; codeword length; encoder; runlength-limited code; Binary sequences; Decoding; Equations; Information theory; Mathematics; Memory; Optical design; Optical recording; Parity check codes; Upper bound; Fibonacci numbers; Shannon capacity; finite-state machine (FSM); generalized Fibonacci numbers; runlength-limited (RLL) codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.876231
