Growth function of self-complementary circular codes.
In several papers Arquès and Michel studied the maximal circular codes consisting of words of length 3 (or trinucleotides) on the genetic alphabet {A, C, G, T}. We present here some additional information on these codes. In particular, we study the growth function of the self-complementary circular codes and we prove that among them exactly 528 are maximal.
Algorithms↗