| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331040 | Information Processing Letters | 2016 | 4 Pages |
Abstract
In this paper we derive the linear complexity of binary sequences of length 2p with optimal three-level autocorrelation. These almost balanced and balanced sequences are constructed by cyclotomic classes of order four using a method presented by Ding et al. We investigate the linear complexity of above-mentioned sequences over the finite fields of different orders.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
V. Edemskiy, A. Palvinskiy,