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 language | English |
|---|---|
| Title of host publication | 19th International Conference on Computer and Information Technology, ICCIT 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 266-269 |
| Number of pages | 4 |
| ISBN (Electronic) | 9781509040896 |
| DOIs | |
| Publication status | Published - Feb 21 2017 |
| Event | 19th International Conference on Computer and Information Technology, ICCIT 2016 - Dhaka, Bangladesh Duration: Dec 18 2016 → Dec 20 2016 |
Other
| Other | 19th International Conference on Computer and Information Technology, ICCIT 2016 |
|---|---|
| Country | Bangladesh |
| City | Dhaka |
| Period | 12/18/16 → 12/20/16 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
Cite this
Linear complexity of signed binary sequence over odd characteristic field. / Hiroto, I. N.O.; Arshad, Ali Md; Ogawa, Chiaki; Nogami, Yasuyuki.
19th International Conference on Computer and Information Technology, ICCIT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 266-269 7860207.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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
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
SP - 266
EP - 269
BT - 19th International Conference on Computer and Information Technology, ICCIT 2016
PB - Institute of Electrical and Electronics Engineers Inc.
ER -