An algorithm for optimal comma free codes with isomorphism rejection

Authors

Hao Wang, Michigan Technological University
Vladimir Tonchev, Michigan Technological UniversityFollow

Document Type

Conference Proceeding

Publication Date

2009

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.

Publisher's Statement

Copyright © 2019 ACM, Inc. Publisher’s version of record: https://dx.doi.org/10.1145/1529282.1529502

Publication Title

SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing

ISBN

978-1-60558-166-8

Recommended Citation

Wang, H., & Tonchev, V. (2009). An algorithm for optimal comma free codes with isomorphism rejection. SAC '09 Proceedings of the 2009 ACM symposium on Applied Computing, 1007-1008. http://doi.org/10.1145/1529282.1529502
Retrieved from: https://digitalcommons.mtu.edu/math-fp/106