DocumentCode
907546
Title
Codes with synchronization capability
Author
Scholtz, R.A.
Volume
12
Issue
2
fYear
1966
fDate
4/1/1966 12:00:00 AM
Firstpage
135
Lastpage
142
Abstract
A synchronizable
code has the property that the punctuation (comma or no comma, comma indicating that the next symbol is the beginning of a new code word) at a given position in a code symbol stream can always be determined by observing at most
code symbols in the neighborhood of the position in question. The construction of
dictionaries and the mechanization of synchronizers using nonlinear shift registers are explained in detail. Necessary and sufficient conditions for the existence of
codes with specified word lengths are derived. By allowing unequal word lengths in the code, it is demonstrated that a substantial saving in average word length and information rate can be accomplished over other recently proposed codes having synchronization capability.
code has the property that the punctuation (comma or no comma, comma indicating that the next symbol is the beginning of a new code word) at a given position in a code symbol stream can always be determined by observing at most
code symbols in the neighborhood of the position in question. The construction of
dictionaries and the mechanization of synchronizers using nonlinear shift registers are explained in detail. Necessary and sufficient conditions for the existence of
codes with specified word lengths are derived. By allowing unequal word lengths in the code, it is demonstrated that a substantial saving in average word length and information rate can be accomplished over other recently proposed codes having synchronization capability.Keywords
Coding; Comma-free codes; Synchronization; Contracts; Delay effects; Dictionaries; Helium; Information rates; Shift registers; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1966.1053874
Filename
1053874
Link To Document