The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
Information Processing Letters
On the distinctness of modular reductions of primitive sequences over Z/(232-1)
Designs, Codes and Cryptography
| Hi-index | 754.84 |
An upper bound for the incomplete exponential sums over Galois rings is derived explicitly. Based on the incomplete exponential sums, we analyze the partial period properties of some binary sequences derived from Z2l in detail, such as the Kerdock-code binary sequences and the highest level sequences of primitive sequences over Z2l. The results show that the partial period distributions and the partial period independent r-pattern distributions of these binary sequences are asymptotically uniform. Nontrivial upper bounds for the aperiodic autocorrelation of these sequences are also given.