Maximal prefix synchronized codes by means of enumerative coding

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.