Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T13:52:23.297Z Has data issue: false hasContentIssue false

Regent Results in Comma-Free Codes

Published online by Cambridge University Press:  20 November 2018

B. H. Jiggs*
Affiliation:
California Institute of Technology
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A set D of k-letter words is called a comma-free dictionary (2), if whenever (a 1 a 2 . . . ak ) and (b 1 b 2 . . . bk ) are in D, the "overlaps" (a 2 a 3 . . . ak b 1), (a 3 a 4 . . . ak b 1 b 2), . . . , (ak b 1 . . . bk -1) are not in D. We say that two k-letter words are in the same equivalence class if one is a cyclic permutation of the other. An equivalence class is called complete if it contains k distinct members. Comma-freedom is violated if we choose words from incomplete equivalence classes, or if more than one word is chosen from the same complete class.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1963