Comma-Free Codes | Canadian Journal of Mathematics | Cambridge Core (original) (raw)

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.

Let n be a fixed positive integer, and consider an alphabet consisting of the numbers 1, 2, … , n. With this alphabet form all possible k-letter words (a1a2 … ak), where k is also fixed. There are evidently nk such words in all.

References

1. Crick, H. C., Griffith, J. S., and Orgel, L. E., Codes Without Commas, Proc. Nat. Acad. Sci., 43 (1957), 416-421.Google Scholar

2. McMillan, B., Two Inequalities Implied by Unique Decipherability, IRE Transactions on Information Theory, 2 (1956), 115-116.Google Scholar

3. Nagell, T., Introduction to Number Theory (Uppsala, 1951).Google Scholar