Linear complexity of signed binary sequence over odd characteristic field

I. N.O. Hiroto, Ali Md Arshad, Chiaki Ogawa, Yasuyuki Nogami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In our previous work, well balanced pseudo random signed binary sequence generated by using trace function and Legendre symbol has been researched. Our previous sequence generated by applying primitive polynomial over odd characteristic field Fp, trace function and Legendre symbol. The important features such as period, periodic autocorrelation, and crosscorrelation have already been well discussed in our previous work. In this paper, the signed binary sequence is generated by utilizing one additional parameter A. Let p be an odd prime and Fp is an odd characteristic prime field and m be the degree of the primitive polynomial f(x). The procedure for generating sequence is as follows: primitive polynomial f(x) generates maximum length vector sequence, then trace function Tr maps an element of extension field Fpm to an element of prime field Fp, next a non-zero scalar A Fp is added to the trace value and finally Legendre symbol is used to map the scalars into signed binary sequence. In this paper, the authors have restricted the discussion on linear complexity and linear complexity profile properties of signed binary sequence based on some experimental results.

Original languageEnglish
Title of host publication19th International Conference on Computer and Information Technology, ICCIT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages266-269
Number of pages4
ISBN (Electronic)9781509040896
DOIs
Publication statusPublished - Feb 21 2017
Event19th International Conference on Computer and Information Technology, ICCIT 2016 - Dhaka, Bangladesh
Duration: Dec 18 2016Dec 20 2016

Other

Other19th International Conference on Computer and Information Technology, ICCIT 2016
CountryBangladesh
CityDhaka
Period12/18/1612/20/16

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Linear complexity of signed binary sequence over odd characteristic field'. Together they form a unique fingerprint.

  • Cite this

    Hiroto, I. N. O., Arshad, A. M., Ogawa, C., & Nogami, Y. (2017). Linear complexity of signed binary sequence over odd characteristic field. In 19th International Conference on Computer and Information Technology, ICCIT 2016 (pp. 266-269). [7860207] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCITECHN.2016.7860207