ENUMERATION OF LINEAR RECURRING m-ARRAYS

Liu Mulan;Lin Dongdai

系统科学与复杂性(英文) ›› 1991, Vol. 4 ›› Issue (4) : 368-373.

PDF(323 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(323 KB)
系统科学与复杂性(英文) ›› 1991, Vol. 4 ›› Issue (4) : 368-373.
论文

ENUMERATION OF LINEAR RECURRING m-ARRAYS

    Liu Mulan(1);Lin Dongdai(2)
作者信息 +

ENUMERATION OF LINEAR RECURRING m-ARRAYS

    Liu Mulan(1);Lin Dongdai(2)
Author information +
文章历史 +

摘要

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.

Abstract

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.

关键词

Array / αr-array / linear recurring array / L

Key words

Array / αr-array / linear recurring array / LR m-array / translation equivalence class

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
Liu Mulan , Lin Dongdai. ENUMERATION OF LINEAR RECURRING m-ARRAYS. 系统科学与复杂性(英文), 1991, 4(4): 368-373
Liu Mulan , Lin Dongdai. ENUMERATION OF LINEAR RECURRING m-ARRAYS. Journal of Systems Science and Complexity, 1991, 4(4): 368-373
PDF(323 KB)

108

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉