Hostname: page-component-7dd5485656-pnlb5 Total loading time: 0.001 Render date: 2025-10-30T16:15:07.280Z Has data issue: false hasContentIssue false
  • English
  • Français

Comma-Free Codes

Published online by Cambridge University Press:  20 November 2018

S. W. Golomb ,
Basil Gordon  and
L. R. Welch
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.

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.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 10 , 1958 , pp. 202 - 209
Copyright
Copyright © Canadian Mathematical Society 1958 

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