Open Access System for Information Sharing

Login Library

 

Article
Cited 18 time in webofscience Cited 0 time in scopus
Metadata Downloads

On binary sequences of period n = p(m)-1 with optimal autocorrelation

Title
On binary sequences of period n = p(m)-1 with optimal autocorrelation
Authors
TOR HELLESETHK. Yang
POSTECH Authors
K. Yang
Date Issued
Jan-2002
Publisher
SPRINGER
Abstract
Binary sequences of period n = p(m) - 1 for an odd prime p are introduced in [4] by taking the characteristic sequence of the image set of the polynomial (z + 1)(d) + az(d) + b over the finite field F,- of p(m) elements. It was shown in [4] that they are (almost) balanced and have optimal autocorrelation in the case where the polynomial can be transformed into the form z(2) - C. In this paper, we show that the sequences are (almost) balanced and have optimal autocorrelation in the case of d = (p(m) + 1)/2, a = (-1)(d-1) and b = +/-1. Furthermore, we show that they are equivalent to the Lempel-Cohn-Eastman sequence in [2] in the balanced case. We also give a direct proof of the autocorrelation property of the Lempel-Cohn-Eastman sequence and discuss its linear complexity.
URI
http://oasis.postech.ac.kr/handle/2014.oak/13499
Article Type
Article
Citation
SEQUENCES AND THEIR APPLICATIONS, PROCEEDINGS, page. 209 - 217, 2002-01
Files in This Item:

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

양경철YANG, KYEONG CHEOL
Dept of Electrical Enginrg
Read more

Views & Downloads

Browse