On the Linear Complexity of a Class of Quaternary Sequences with Low Autocorrelation

Lu ZHAO; Qiao-yan WEN; Jie ZHANG

doi:10.1587/transfun.E96.A.997

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

On the Linear Complexity of a Class of Quaternary Sequences with Low Autocorrelation

Lu ZHAO, Qiao-yan WEN, Jie ZHANG

Author information

Keywords: quaternary sequences, Galois ring, CDMA, linear complexity

JOURNAL RESTRICTED ACCESS

2013 Volume E96.A Issue 5 Pages 997-1000

DOI https://doi.org/10.1587/transfun.E96.A.997

Details

Abstract

The linear complexity of quaternary sequences plays an important role in cryptology. In this paper, the minimal polynomial of a class of quaternary sequences with low autocorrelation constructed by generalized cyclotomic sequences pairs is determined, and the linear complexity of the sequences is also obtained.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!