A construction is given which produces maximal (in number of words) comma-free codes for any odd word lengthnand any alphabet sizeσ.
No takes yet. Share an insight, caveat, or question.
Willard L. Eastman (1965) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: