摘要
考察了满足一定限制条件的长度为ｎ具有ｍ个水平的数列计数问题，给出了它们的递归式和显表达式；
In this paper,soml problems of counting the n umber of m level digital sequlnces of length n that satisfy some constraints are considered and their recursive formulas and explicit formulations arl given.A result of combinatorial lnumlration of kly codlwords is improved and some combinatorial identical relations are got.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
1997年第3期303-307,共5页
Journal of University of Electronic Science and Technology of China
关键词
编码数
生成函数
递归式
钥匙编码
组合计数
coded number
generating function
recursive formula
explicit formula
