期刊导航

论文摘要

基于二重分圆术的二元序列的线性复杂度计算

Linear complexity of binary sequences based on two fold cyclotomy

作者:孙玉莹(德州学院数学科学学院);任文丽(德州学院数学科学学院)

Author:SUN Yu-Ying(College of Mathematical Sciences, Dezhou University);REN Wen-Li(College of Mathematical Sciences, Dezhou University)

收稿日期:2014-10-30          年卷(期)页码:2015,52(4):748-754

期刊名称:四川大学学报: 自然科学版

Journal Name:Journal of Sichuan University (Natural Science Edition)

关键字:分圆术; 线性复杂度; 二元序列

Key words:Cyclotomy; Linear complexity; Binary sequence

基金项目:山东省高等学校科研计划项目(J14LI56)

中文摘要

在密码学、序列设计与编码理论的许多应用中有多种分圆术.最近,Chung和Yang提出了一种新的k重分圆术并被用于设计具有良好相关性质的序列.本文基于二重分圆术研究了一类二元序列的线性复杂度的计算,同时给出了相应构造序列的极小多项式的计算.

英文摘要

There are several kinds of cyclotomy and they have important applications in many applications such as cryptography, sequence design and coding theory. Recently, a new type of k fold cyclotomy introduced by Chung and Yang was used to design sequences with nice correlation properties. In this paper, we give an investigation of the linear complexity (linear span) of binary sequences based on two fold cyclotomy . The minimal polynomials of these sequences are calculated as well.

关闭

Copyright © 2020四川大学期刊社 版权所有.

地址:成都市一环路南一段24号

邮编:610065