Enumeration results on linear complexity profiles and lattice profiles

Warning The system is temporarily closed to updates for reporting purpose.

Meidl, Wilfried (2006) Enumeration results on linear complexity profiles and lattice profiles. Journal of complexity, 22 (2). pp. 275-286. ISSN 0885-064X

[thumbnail of 3011800001061.pdf] PDF
3011800001061.pdf
Restricted to Repository staff only

Download (171kB) | Request a copy

Abstract

We present enumeration results on the linear complexity profile and the related lattice profile, a complexity measure based on Marsaglia's lattice test, of sequences over finite fields. In particular, we calculate the number of sequences with prescribed profiles and analyze the increase frequency, that is the jump complexity analog for the lattice profile. Moreover, we provide some results on sequences with a k-almost perfect linear complexity profile respectively lattice profile. Finally, we present some distribution properties of binary sequences with length N and perfect lattice profile.
Item Type: Article
Uncontrolled Keywords: sequences over finite fields; linear complexity profile; Marsaglia's lattice test; lattice profile
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Wilfried Meidl
Date Deposited: 27 Oct 2006 03:00
Last Modified: 26 Apr 2022 08:12
URI: https://research.sabanciuniv.edu/id/eprint/678

Actions (login required)

View Item
View Item