A new class of codes for frame synchronization is proposed. Commonly, the beginning of every fixed or variable-length frame is identified by a given contiguous sequence called a prefix. To avoid the occurrence of the prefix elsewhere in the frame, a prefix synchronizable code (PS-code) is used. PS-codes have the property that the prefix does not occur in any codeword or in any concatenation of codewords in any position other than the first position. The new codes, termed partial-prefix synchronizable codes (PPS-codes), use a fixed sequence of symbols that is interspersed with symbols that carry information. The contiguous sequence from the first fixed symbol to the last fixed symbol is called a "partial-prefix." Consequently, not one but a set of possible prefixes is used, and none of these prefixes is allowed to occur at any other than the first position of a codeword. The cardinality of PPS-codes is determined, and coding algorithms are proposed which have a computational complexity proportional to the length of the codewords. It is demonstrated that in comparison with PS-codes, PPS-codes have similar coding and prefix detection complexity, but they have a larger code size and have better error control capabilities.
[1]
David M. Mandelbaum.
Synchronization of codes by means of Kautz's Fibonacci encoding
,
1972,
IEEE Trans. Inf. Theory.
[2]
Peter Tolstrup Nielsen,et al.
On the expected duration of a search for a fixed pattern in random data
,
1973
.
[3]
Robert A. Scholtz,et al.
Frame Synchronization Techniques
,
1980,
IEEE Trans. Commun..
[4]
S. Golomb,et al.
Comma-Free Codes
,
1958,
Canadian Journal of Mathematics.
[5]
Thomas M. Cover,et al.
Enumerative source encoding
,
1973,
IEEE Trans. Inf. Theory.
[6]
Edgar N. Gilbert,et al.
Synchronization of binary messages
,
1960,
IRE Trans. Inf. Theory.
[7]
Leonidas J. Guibas,et al.
String Overlaps, Pattern Matching, and Nontransitive Games
,
1981,
J. Comb. Theory A.
[8]
Leo J. Guibas,et al.
Maximal Prefix-Synchronized Codes
,
1978
.
[9]
William H. Kautz.
Ieee Transactions on Information Theory Co~tcluding Remarks
,
2022
.
[10]
Adriaan J. de Lind van Wijngaarden,et al.
On the construction of maximal prefix-synchronized codes
,
1996,
IEEE Trans. Inf. Theory.
[11]
J. J. Stiffler,et al.
Theory of synchronous communications
,
1971
.