Skip to Main Content
Bounded synchronization delay codes have the property that no proper cyclic rearrangement of the letters of a codeword is another codeword. Because of this property research in code design has centered on criteria for selecting one word from each nonperiodic cyclic equivalence class to satisfy various additional constraints. This is all that is necessary when it is feasible for the encoder and decoder to use table look-up procedures. However, even for moderate word length, the dictionary size can be quite large and prove a major obstacle in practical applications. This paper describes a systematic procedure for mapping data sequences into nonperiodic cyclic equivalence classes and for performing the inverse mapping. The scheme is arithmetic in nature and does not require large tables.