Construction of pseudorandom binary sequences using additive characters over GF(2
k
) |
| |
| Authors: | János Folláth |
| |
| Institution: | (1) Faculty of Computer Science, University of Debrecen, Egyetem tér 1, H-4032 Debrecen, Hungary |
| |
| Abstract: | In a series of papers Mauduit and Sárközy (partly with coauthors) studied finite pseudorandom binary sequences and they constructed sequences with strong pseudorandom properties. In these constructions fields with prime order were used. In this paper a new construction is presented, which is based on finite fields of order 2 k . |
| |
| Keywords: | and phrases" target="_blank"> and phrases binary sequence character sums normality measure pseudorandom |
| 本文献已被 SpringerLink 等数据库收录！ |
