Preamble-less group synchronization of binary linear block codes

This paper addresses the possibility to realize the group synchronization of short linear, binary, block codes without the use of a preamble. The proposed algorithm is based on the cyclic use of the coding relations. The input data are equal probable and generated by a binary, memoryless source. We consider a binary symmetric channel (BSC) with known error probability. It is shown that the reliability of the proposed algorithm depends on the channel error probability and the length of the cumulative sums used for synchronization.