2000 character limit reached
Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
Published 22 Aug 2011 in cs.IT and math.IT | (1108.4450v1)
Abstract: This paper gives the linear complexity of binary Ding-Helleseth generalized cyclotomic sequences of any order.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.