DocumentCode
1014418
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
Volume
52
Issue
7
fYear
2006
fDate
7/1/2006 12:00:00 AM
Firstpage
3313
Lastpage
3319
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2006.876231
Filename
1650376
Link To Document