搜索结果: 1-1 共查到“代数学 enumeration”相关记录1条 . 查询时间(0.093 秒)
In this paper we prove that the number of translation equivalence classes of linear recurring m-arrays over F_q with period (r,s) is(φ(rs))/(log_q(rs+1)), where φ is Euler function.