On the k-error linear complexity of binary sequences derived from the discrete logarithm in finite fields.
Zhixiong ChenQiuyan WangPublished in: CoRR (2019)
Keyphrases
- finite number
- binary valued
- unit interval
- hidden markov models
- continuous space
- computer vision
- translation invariant
- sufficient conditions
- variable length
- sequence alignment
- continuous valued
- ridgelet transform
- convex sets
- continuous functions
- multiple sequence alignment
- long sequences
- multi class
- multiscale
- discrete version
- arbitrary size
- signed distance
- data sets