Comma-Free Codes

S. W. Golomb, Basil Gordon, Lloyd R. Welch · Canadian Journal of Mathematics · 1958

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.

Cited by 218 works. doi:10.4153/cjm-1958-023-9 Open-access PDF

Authors

References