A note on an OACF-preserving operation based on Parker's Transformation
Information Theory
2020-04-09 v1 Combinatorics
math.IT
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.
Cite
@article{arxiv.2004.03799,
title = {A note on an OACF-preserving operation based on Parker's Transformation},
author = {Geyang Wang and Qi Wang},
journal= {arXiv preprint arXiv:2004.03799},
year = {2020}
}
Comments
9 pages