English
Related papers

Related papers: New Optimal Binary Sequences with Period $4p$ via …

200 papers

Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and…

Information Theory · Computer Science 2013-10-11 Wijik Lee , Ji-Youp Kim , Jong-Seon No

Sequences exhibiting favorable ambiguity function characteristics play a critical role in radar detection systems and modern mobile communication applications. As a newly developed sequence family, Doppler resilient complementary sequence…

Information Theory · Computer Science 2026-04-20 Xuanyu Liu , Pinhui Ke , Zuling Chang

Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…

Combinatorics · Mathematics 2026-03-20 Chris J Mitchell , Peter R Wild

Sequences with excellent ambiguity functions are very useful in radar detection and modern mobile communications. Doppler resilient complementary sequence (DRCS) is a new type of sequence proposed recently, which can achieve lower ambiguity…

Information Theory · Computer Science 2025-08-22 Bingsheng Shen , Zhengchun Zhou , Yang Yang , Pingzhi Fan

Certain applications require the use of signals that combine both the capability to operate with low signal-to-noise ratios and the ability to support multiple users without interference. In the case where many users have very different…

Information Theory · Computer Science 2021-03-10 Patricio G. Donato , Matias N. Hadad , Marcos A. Funes

The search for binary sequences with a high figure of merit, known as the low autocorrelation binary sequence ($labs$}) problem, represents a formidable computational challenge. To mitigate the computational constraints of the problem, we…

Data Structures and Algorithms · Computer Science 2017-05-09 Borko Bošković , Franc Brglez , Janez Brest

New generalized cyclotomic binary sequences of period $p^2$ are proposed in this paper, where $p$ is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences…

Discrete Mathematics · Computer Science 2018-07-10 Zibi Xiao , Xiangyong Zeng , Chunlei Li , Tor Helleseth

The paper introduces new types of nonlinear correlations between bivariate data sets and derives nonlinear auto-correlations on the same data set. These auto-correlations are of different types to match signals with different types of…

Chaotic Dynamics · Physics 2014-09-23 Sanjay Kumar Palit , Sayan Mukherjee , D. K. Bhattacharya

In this paper three Schur ring are discussed, namenly: Hamming, circulant orbists and decimated circulant orbits Schur ring. By using autocorrelation function and the run structure of binary sequences we proof the relation between this…

Combinatorics · Mathematics 2018-07-31 Ronald Orozco López

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

Information Theory · Computer Science 2017-03-28 Kelly T. R. Boothby , Daniel J. Katz

We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information…

Information Theory · Computer Science 2014-06-17 Honggang Hu

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

Combinatorics · Mathematics 2026-03-20 Abbas Alhakim , Chris J. Mitchell , Janusz Szmidt , Peter R. Wild

Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory…

Information Theory · Computer Science 2023-11-01 Zhonghua Sun , Ling Li , Shixin Zhu

Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences…

Other Computer Science · Computer Science 2013-01-15 Anatolii Leukhin , Egor Potehin

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang

The search of binary sequences with low auto-correlations (LABS) is a discrete combinatorial optimization problem contained in the NP-hard computational complexity class. We study this problem using Warning Propagation (WP) , a message…

Disordered Systems and Neural Networks · Physics 2017-07-12 Ilias Kotsireas , Alejandro Lage-Castellanos , Orlando E. Martínez-Durive , Roberto Mulet

Controlling peak side-lobe level (PSL) is of great importance in high-resolution applications of multiple-input multiple-output (MIMO) radars. In this paper, designing sequences with good autocorrelation properties are studied. The PSL of…

Signal Processing · Electrical Eng. & Systems 2020-10-09 Hamid Esmaeili Najafabadi , Mohammad Ataei , Mohamad F. Sabahi

Analogously to de Bruijn sequences, orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., a range of…

Combinatorics · Mathematics 2026-03-20 Chris J Mitchell , Peter R Wild

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 Analysis, Statistics and Probability · Physics 2015-06-19 O. V. Usatenko , S. S. Melnik , S. S. Apostolov , N. M. Makarov , A. A. Krokhin

This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…

Cryptography and Security · Computer Science 2013-11-28 Subhash Kak