相关论文: New Results on Periodic Golay Pairs

We construct supplementary difference sets (SDS) with parameters $(72;36,30;30)$. These SDSs give periodic Golay pairs of length 72. No periodic Golay pair of length 72 was known previously. The smallest undecided order for periodic Golay…

Periodic Golay pairs are a generalization of ordinary Golay pairs. They can be used to construct Hadamard matrices. A positive integer $v$ is a (periodic) Golay number if there exists a (periodic) Golay pair of length $v$. Taking into the…

We provide a complete enumeration of all complex Golay pairs of length up to 25, verifying that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. This independently verifies work done by F. Fiedler in 2013…

This paper aims to search for new optimal and sub-optimal Odd Binary Z-Complimentary Pairs (OBZCPs) for lengths up to 49. As an alternative to the celebrated binary Golay complementary pairs, optimal OBZCPs are the best almost-complementary…

3-phase Golay sequence and array triads are a natural generalisation of 2-phase Golay sequence pairs, yet their study has until now been largely neglected. We present exhaustive search results for 3-phase Golay sequence triads for all…

Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…

A collection of complex sequences of length v is complementary if the sum of their periodic autocorrelation function values at all non-zero shifts is constant. For a complex sequence A=[a_0,a_1,...,a_{v-1}] of length v=dm we define the…

Zero correlation zone (ZCZ) sequences and Golay sequences are two kinds of sequences with different preferable correlation properties. It was shown by Gong \textit{et al.} and Chen \textit{et al.} that some Golay sequences also possess a…

The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…

We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2^N using Boolean functions. The algorithm follows our earlier paraunitary algorithm,…

Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively…

Zero correlation zone (ZCZ) sequences and Golay complementary sequences are two kinds of sequences with different preferable correlation properties. Golay-ZCZ sequences are special kinds of complementary sequences which also possess a large…

We analyze the grammar generation algorithm of the RePair compression algorithm and show the relation between a grammar generated by RePair and maximal repeats. We reveal that RePair replaces step by step the most frequent pairs within the…

The search for continuous gravitational waves demands computationally efficient algorithms that can handle highly non-linear parameter spaces. Loosely coherent algorithms establish upper limits and detect signals by analyzing families of…

In this work, we construct $4$-phase Golay complementary sequence (GCS) set of cardinality $2^{3+\lceil \log_2 r \rceil}$ with arbitrary sequence length $n$, where the $10^{13}$-base expansion of $n$ has $r$ nonzero digits. Specifically,…

We propose a new efficient iterative method for generating random correlated binary sequences with prescribed correlation function. The method is based on consecutive linear modulations of initially uncorrelated sequence into a correlated…

Data compression algorithms are generally perceived as being of interest for data communication and storage purposes only. However, their use in the field of data classification and analysis is also of equal importance. Automatic data…

This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation…

We describe several new techniques which accelerate Bayesian searches for continuous gravitational-wave emission from supermassive black-hole binaries using pulsar timing arrays. These techniques mitigate the problematic increase of…

We present OnPair, a dictionary-based compression algorithm designed to meet the needs of in-memory database systems that require both high compression and fast random access. Existing methods either achieve strong compression ratios at…