Almost Difference Set Pairs and Ideal Three-Level Correlation Binary Sequence Pairs

Abstract

Almost difference set pairs are used in cryptography and coding theory, and a majority of the acknowledged almost difference set pairs are constructed by Chinese remainder theorem, cyclotomy or interleaving. In this paper, through the addition or deletion of elements from difference sets and difference set pairs, we ourselves construct almost difference set pairs and sequences thereof. Further, we obtain the ideal three-level correlation binary sequence pairs with high energy efficiency by some renown difference sets or difference set pairs, e.g. Palay-Hardmard difference sets.