## Enumeration results on linear complexity profiles and lattice profilesMeidl, Wilfried (2006)
Official URL: http://dx.doi.org/10.1016/j.jco.2005.09.002 ## AbstractWe 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.
Repository Staff Only: item control page |