Please use this identifier to cite or link to this item:
|Title:||Z8-Kerdock codes and pseudorandom binary sequences||Authors:||Lahtonen, J.
Geralized Kerdock code
Most significant bit map
|Issue Date:||Apr-2004||Citation:||Lahtonen, J.,Ling, S.,Solé, P.,Zinoviev, D. (2004-04). Z8-Kerdock codes and pseudorandom binary sequences. Journal of Complexity 20 (2-3) : 318-330. ScholarBank@NUS Repository.||Abstract:||The ℤ8-analogues of the Kerdock codes of length n = 2m were introduced by Carlet in 1998. We study the binary sequences of period n - 1 obtained from their cyclic version by using the most significant bit (MSB)-map. The relevant Boolean functions are of degree 4 in general. The linear span of these sequences has been known to be of the order of m4. We will show that the crosscorrelation and nontrivial autocorrelation of this family are both upper bounded by a small multiple of n. The nonlinearity of these sequences has a similar lower bound. A generalization of the above results to the alphabet ℤ2l, l≥4 is sketched out. © 2003 Published by Elsevier Inc.||Source Title:||Journal of Complexity||URI:||http://scholarbank.nus.edu.sg/handle/10635/104483||ISSN:||0885064X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 20, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.