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

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1016/j.jco.2005.09.002


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
ID Code:678
Deposited By:Wilfried Meidl
Deposited On:27 Oct 2006 03:00
Last Modified:25 May 2011 14:14

Repository Staff Only: item control page