Generating M Sequences from Pairs of Nonsingular Boolean Functions

苏驷希; 吴伟陵; 周炯槃

您当前的位置：

首页 >

文章列表页 >

Generating M Sequences from Pairs of Nonsingular Boolean Functions

更新时间：2025-12-08

- Generating M Sequences from Pairs of Nonsingular Boolean Functions
- Acta Electronica Sinica Issue 1, (1997)
- 作者机构：
  
  北京邮电大学信息工程系
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP301.6
- Published：1997
- 稿件说明：
移动端阅览
[1]苏驷希,吴伟陵,周炯槃.从非奇异布尔函数对产生M序列[J].电子学报,1997(01):106-109.

苏驷希, 吴伟陵, 周炯槃. Generating M Sequences from Pairs of Nonsingular Boolean Functions[J]. Acta Electronica Sinica, 1997, (1).
[1]苏驷希,吴伟陵,周炯槃.从非奇异布尔函数对产生M序列[J].电子学报,1997(01):106-109. DOI：

苏驷希, 吴伟陵, 周炯槃. Generating M Sequences from Pairs of Nonsingular Boolean Functions[J]. Acta Electronica Sinica, 1997, (1). DOI：

摘要

本文指出一种构造产生Ｍ序列的方法，它是基于圈的合并，给出一个计数公式．并给出一个简单的生成算法，不同的非奇异布尔函数对生成不同的Ｍ序列，从而可以生成２２ｎ－１－１个ｎ＋１级Ｍ序列．

Abstract

In this paper

a method of generating M sequences is introduced. The method is based on the principle of cycle joining and a counting formula is given. A simple algorithm of generating M sequences is given

pairs of nonsingular boolean functions generate unqiue M sequence

then the number of generated M sequences of period 2n+1 is 22n-1-1.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

On the Statistical Properties of the CrossInterference in theDSCDMA System Using the WHm/M Concatenated Sequences

Construction of First Class of m Subsequences

On the Crosscorrelation of m Sequence over Finite Field and Its Decimation Sequence

Related Author

Ren Yong

Wei Shuangqing

Shan Xiumin

LV Hong

DUAN Ying-ni

GUAN Bi-cong

LIU Yu-lan

张振涛

Related Institution

Dept. of Electronic Engineering, Tsinghua Univ.

Anhui University of Technology and Science

Information Security Center of Beijing Univ.of Posts and Telecomms P.O.Box 126,Beijing 1000876

北京邮电大学信息安全中心

中国科学院系统科学研究所

⁰