(M-1) and (M-2) selfsynchronising M-ary codes generated with coding efficiency

The presented algorithm can generate two kinds of self-synchronising M-ary variable length codes that are the (M-1) codes and the (M-2) codes, respectively. Each of the constructed codes derived by this algorithm has the self-synchronising property so that the decoder can always reach resynchronisation within a certain number of codewords when an error occurs during transmission. The two kinds of generated M-ary codes are also discussed in terms of the efficiency of resynchronising as well as data compression. The proposed algorithm, which can generate various M-ary codes, actually provides a large variety of choices to create an M-ary variable length code for obtaining data compression while keeping the capability of self-synchronisation when a specific probability distribution of a source is considered