Login / Signup

A lower bound on the 2-adic complexity of Whiteman's generalized cyclotomic sequences of order 4 with length pq.

Yuhua SunQiang WangQiuyan WangTongjiang Yan
Published in: IWSDA (2017)
Keyphrases
  • lower bound
  • worst case
  • upper bound
  • arbitrary length
  • information systems
  • database
  • data sets
  • feature selection
  • memory requirements
  • finite alphabet