Author:
Golomb S. W.,Gordon Basil,Welch L. R.
Abstract
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
(a
1
a
2 … a
k
), where k is also fixed. There are
evidently n
k
such words in all.
Publisher
Canadian Mathematical Society
Cited by
144 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献