2000 character limit reached
A note on an OACF-preserving operation based on Parker's Transformation
Published 8 Apr 2020 in cs.IT, math.CO, and math.IT | (2004.03799v1)
Abstract: Binary sequences with low odd-periodic correlation magnitudes have found important applications in communication systems. It is well known that the nega-cyclic shift and negation preserve the odd-periodic autocorrelation function (OACF) values in general. In this paper, we define a new operation based on Parker's transformation, which also preserves the OACF values of binary sequences. This enables us to classify Parker's 16 cases into 8 ones, and may possibly further allow to classify all constructions based on Parker's transformation.
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.