Codes with synchronization capability
- 1 April 1966
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 12 (2) , 135-142
- https://doi.org/10.1109/tit.1966.1053874
Abstract
A synchronizable(SC_{s})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 mostscode symbols in the neighborhood of the position in question. The construction ofSC_{s}dictionaries and the mechanization of synchronizers using nonlinear shift registers are explained in detail. Necessary and sufficient conditions for the existence ofSC_{s}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
This publication has 6 references indexed in Scilit:
- Codes with bounded synchronization delayInformation and Control, 1965
- On the construction of comma-free codesIEEE Transactions on Information Theory, 1965
- On synchronizable and PSK-synchronizable block codesIEEE Transactions on Information Theory, 1964
- Regent Results in Comma-Free CodesCanadian Journal of Mathematics, 1963
- Path-invariant comma-free codesIEEE Transactions on Information Theory, 1962
- Comma-Free CodesCanadian Journal of Mathematics, 1958