an algorithm for optimal comma free codes with isomorphism rejection
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.
comma-free codes code synchronization applied computing