TY - GEN

T1 - Linear complexity of signed binary sequence over odd characteristic field

AU - Hiroto, I. N.O.

AU - Arshad, Ali Md

AU - Ogawa, Chiaki

AU - Nogami, Yasuyuki

N1 - Publisher Copyright:
© 2016 IEEE.

PY - 2017/2/21

Y1 - 2017/2/21

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85016222162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85016222162&partnerID=8YFLogxK

U2 - 10.1109/ICCITECHN.2016.7860207

DO - 10.1109/ICCITECHN.2016.7860207

M3 - Conference contribution

AN - SCOPUS:85016222162

T3 - 19th International Conference on Computer and Information Technology, ICCIT 2016

SP - 266

EP - 269

BT - 19th International Conference on Computer and Information Technology, ICCIT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 19th International Conference on Computer and Information Technology, ICCIT 2016

Y2 - 18 December 2016 through 20 December 2016

ER -