Title :
Maximal prefix synchronized codes by means of enumerative coding
Author :
Morita, Hiroyuki ; Van Wijngaarden, Adriaan ; Vinck, A. J Hail
Author_Institution :
Graduate Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu, Japan
Abstract :
A systematic procedure for mapping data sequences into code words of a binary maximal prefix synchronized (MPS) code as well for the inverse mapping is presented. The complexity of the proposed scheme is proportional to the code word length. In order to be able to choose another prefix, e.g. a Barker sequence, methods will be presented which convert an MPS code into another MPS code with a different prefix. Both the mapping algorithm and the conversion algorithm can be generalized for q-ary prefix synchronized codes
Keywords :
binary sequences; codes; decoding; synchronisation; Barker sequence; MPS code; binary maximal prefix; code word length; conversion algorithm; data sequence mapping; decoding; encoding; enumerative coding; inverse mapping; mapping algorithm; maximal prefix synchronized codes; q-ary prefix synchronized codes; Binary sequences; Decoding;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.550453
