An algorithm for optimal comma free codes with isomorphism rejection

ABSTRACT

A general algorithm for finding optimal comma-free codes and deriving upper bounds on the minimum redundancy of comma-free codes that implements the idea of isomorphism rejection is presented, together with tables with bounds on the minimum redundancy computed by using this algorithm.

REFERENCES

• 1: L. J. Cumming, A Family of Circular Systematic Comma-Free Codes, submitted.
• 2: S. W. Golomb, B. Gordon, and L. R. Welch, Comma-free Codes, Canad. J. Math., 10 (1958), 202--209.
• 3: V. I. Levenshtein, One Method of Constructing Quasi Codes Providing Synchronization in the Presence of Errors, Problems of Information Transmission, 7 (1971), 215--222.
• 4: V. I. Levenshtein, Combinatorial Problems Motivated by Comma-free Codes, Journal of Combinatorial Designs, 12 (2004), 184--196.
• 5: Y. Mutoh, and V. D. Tonchev, Difference Systems of Sets and Cyclotomy, Discrete Mathematics, 308 (2008), 2959--2969.
• 6: V. D. Tonchev, Difference Systems of Sets and Code Synchronization, Rendiconti del Semina rio Matematico di Messina, Series II, 9 (2003), 217--226.
• 7: V. D. Tonchev, Partitions of Difference Sets and Code Synchronization, Finite Fields and their Applications, Finite Fields and Their Appl. 11 (2005), 601--621.
• 8: V. D. Tonchev and H. Wang, An Algorithm for Optimal Difference Systems of Sets, J. Combin. Optimization, 14 (2007), 165--175.
• 9: V. D. Tonchev and H. Wang, Optimal Difference Systems of Sets, Lecture Notes in Computer Science, 3967 (2006), 612--618.
• 10: H. Wang, A New Bound for Difference Systems of Sets, Journal of Combinatorial Mathematics and Combinatorial Computing, 58 (2006), 161--168.

INDEX TERMS

Keywords:
applied computing, code synchronization, comma-free codes