Published November 30, 2010
| Version v1
Journal article
Open
On Linear Complexity of Binary Sequences Generated Using Matrix Recurrence Relation Defined Over Z4
Authors/Creators
- 1. Research Scholar, Dr MGR University, Chennai, India Faculty, Department of Electronics & Communication Engineering Dr. Ambedkar Institute of Technology, Bangalore, 560056, India
- 2. Dean Academic and Head, Department of Electronics & Communication Engineering Nagarjuna College of Engineering & Technology Bangalore, India
- 3. Professor, Department of Mathematics Dr. Ambedkar Institute of Technology, Bangalore- 560056, India
Description
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.
Files
1110ijdps07.pdf
Files
(308.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:f83d2995bd72a95624d60fc1b7bdf689
|
308.8 kB | Preview Download |