Fibonacci codes for synchronization control

A new family of codes is described for representing serial binary data, subject to constraints on the maximum separation between successive changes in value (0 \rightarrow 1, 1 \rightarrow , or both), or between successive like digits ( 0 's, 1 's, or both). These codes have application to...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 11; no. 2; pp. 284 - 292
Main Author Kautz, W.
Format Journal Article
LanguageEnglish
Published IEEE 01.04.1965
Subjects
Binary codes
Clocks
Codes
Decoding
Encoding
Error correction
Recording
Redundancy
Synchronization
Systematics
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.1965.1053772

Cover

More Information
Summary:A new family of codes is described for representing serial binary data, subject to constraints on the maximum separation between successive changes in value (0 \rightarrow 1, 1 \rightarrow , or both), or between successive like digits ( 0 's, 1 's, or both). These codes have application to the recording or transmission of digital data without an accompanying clock. In such cases, the clock must be regenerated during reading (receiving, decoding), and its accuracy controlled directly from the data itself. The codes developed for this type of synchronization are shown to be optimal, and to require a very small amount of redundancy. Their encoders and decoders are not unreasonably complex, and they can be easily extended to include simple error detection or correction for almost the same additional cost as is required for arbitrary data.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1965.1053772