On Linear Complexity of Binary Sequences Generated Using Matrix Recurrence Relation Defined Over Z4

descriptionPublicationkeyboard_double_arrow_right Article 29 Nov 2010Publisher:Academy and Industry Research Collaboration Center (AIRCC)Journal:International Journal of Distributed and Parallel systems, volume 1, pages 68-85 (issn: 2229-3957,

Copyright policy )

Authors: S, Ramesh; K N Haribhat; R Murali;

doi: 10.5121/ijdps.2010.1207 , 10.5281/zenodo.3405813 , 10.5281/zenodo.3405814

On Linear Complexity of Binary Sequences Generated Using Matrix Recurrence Relation Defined Over Z4

- Summary
- Subjects
- Metrics

Abstract

This paper discusses the linear complexity property of binary sequences generated using matrix recurrence relation defined over Z4. Generally algorithm to generate random number is based on recursion with seed value/values. In this paper a linear recursion sequence of matrices or vectors over Z4 is generated from which random binary sequence is obtained. It is shown that such sequences have large linear complexity.

Related Organizations

Dr. M.G.R. Educational and Research Institute
India

Keywords

Matrix Recurrence Relation, Random Sequence, Linear Complexity, Z4 Sequence, Random numbers

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average