A preview of the PDF is not available
On the size of a type of RLL codes
Abstract and Figures
We will report on a relationship between the size of certain runlength-limited (RLL) codes and encoder complexity expressed as the number of encoder states, where the number of encoder states equals a (generalized) Fibonacci number.
Figures - uploaded by Kees Schouhamer Immink
All figure content in this area was uploaded by Kees Schouhamer Immink
Content may be subject to copyright.