A test against trend in random sequences

06/03/2019
by   Peter Lindqvist, et al.
0

We study a modification of Kendall's tau-test, replacing his permutations of n different numbers by sequences of length n, where repetition is allowed. In particular, binary sequences are included. Random sequences can be tested.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2019

On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM)...
research
11/24/2020

The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure

The autocorrelation values of two classes of binary sequences are shown ...
research
09/15/2023

Do Random and Chaotic Sequences Really Cause Different PSO Performance? Further Results

Empirical results show that PSO performance may be different if using ei...
research
07/31/2022

Universal Address Sequence Generator for Memory Built-in Self-test

This paper presents the universal address sequence generator (UASG) for ...
research
08/14/2023

Sequences with identical autocorrelation spectra

Aperiodic autocorrelation measures the similarity between a finite-lengt...
research
02/09/2023

Do Random and Chaotic Sequences Really Cause Different PSO Performance?

Our topic is performance differences between using random and chaos for ...
research
11/10/2022

A Primer on Zadoff Chu Sequences

Zadoff Chu (ZC) sequences are the primary manifestation of spread spectr...

Please sign up or login with your details

Forgot password? Click here to reset