English
Related papers

Related papers: Schur Ring, Run Structure and Periodic Compatible …

200 papers

In this paper a variety of issues are discussed, Schur ring, $S$-sets, circulant orbits, decimation operator and Hadamard matrices and their relation between them is shown. Firstly we define the complete $S$-sets. Next, we study the…

Combinatorics · Mathematics 2019-04-12 Ronald Orozco López

A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…

Signal Processing · Electrical Eng. & Systems 2026-05-12 Piyush Priyanshu , Sudhan Majhi , Subhabrata Paul

We analyze the connection between the autocorrelation of a binary sequence and its run structure given by the run length encoding. We show that both the periodic and the aperiodic autocorrelation of a binary sequence can be formulated in…

Information Theory · Computer Science 2013-08-05 Jürgen Willms

A finite sequence of numbers is perfect if it has zero periodic autocorrelation after a nontrivial cyclic shift. In this work, we study quaternionic perfect sequences having a one-to-one correspondence with the binary sequences arising in…

Combinatorics · Mathematics 2026-02-02 Aidan Bennett , Curtis Bright , Paul Colinot , Ashwin Nayak

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Guang Gong

In this paper, we investigate PN-sequences with ideal autocorrelation property and the consequences of this property on the number of +1s and -1s and run structure of sequences. We begin by discussing and surveying about the length of…

Information Theory · Computer Science 2017-10-10 Mohammad J. Khojasteh , Morteza H. Shoreh , Jawad A. Salehi

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…

Combinatorics · Mathematics 2014-04-28 J. Borges , J. Rifà , V. A. Zinoviev

Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary periodical sequences with a 2-level autocorrelation values. For…

Combinatorics · Mathematics 2018-04-12 X. Niu , H. Cao , K. Feng

We introduce several new constructions for perfect periodic autocorrelation sequences and arrays over the unit quaternions. This paper uses both mathematical proofs and com- puter experiments to prove the (bounded) array constructions have…

Information Theory · Computer Science 2017-01-06 Sam Blake

Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…

Information Theory · Computer Science 2009-09-01 Dragomir Z. Djokovic

Binary self-dual sequences have been considered and analyzed throughout the years, and they have been used for various applications. Motivated by a construction for single-track Gray codes, we examine the structure and recursive…

Information Theory · Computer Science 2025-12-17 Tuvi Etzion

The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to…

Combinatorics · Mathematics 2010-08-05 Mikhail Klin , István Kovács

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…

Information Theory · Computer Science 2026-05-06 Maryam Bajalan , Edgar Martínez-Moro , Hassan Ou-azzou

In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having…

Combinatorics · Mathematics 2018-08-13 Francisco J. Aragón Artacho , Rubén Campoy , Ilias Kotsireas , Matthew K. Tam

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…

Information Theory · Computer Science 2017-03-21 Yuhua Sun , Qiang Wang , Tongjiang Yan

We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is $C_{2t}\times C_2$. We study the rank, the dimension of the kernel, and the structure of these codes. For…

Combinatorics · Mathematics 2019-02-19 Ivan Bailera , Joaquim Borges , Josep Rifà

A new notion of bent sequence related to Hadamard matrices was introduced recently, motivated by a security application ( Sol\'e et al, 2021). We study the self dual class in length at most $196.$ We use three competing methods of…

Combinatorics · Mathematics 2023-04-28 Minjia Shi , Yaya Li , Wei Cheng , Dean Crnković , Denis Krotov , Patrick Solé

This paper studies a special class of states for the dual conformal field theories associated with supersymmetric $AdS_5\times X$ compactifications, where $X$ is a Sasaki-Einstein manifold with additional $U(1)$ symmetries. Under…

High Energy Physics - Theory · Physics 2015-09-02 David Berenstein

Let $G$ be the group $GL_r(C) \times (C^\times)^n$. We conjecture that the finely-graded Hilbert series of a $G$ orbit closure in the space of $r$-by-$n$ matrices is wholly determined by the associated matroid. In support of this, we prove…

Algebraic Geometry · Mathematics 2015-07-20 Andrew Berget , Alex Fink
‹ Prev 1 2 3 10 Next ›