English
Related papers

Related papers: Some New Balanced and Almost Balanced Quaternary S…

200 papers

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

Given a directed graph, we show how to efficiently find a shortest (directed, simple) cycle on an even number of vertices. As far as we know, no polynomial-time algorithm was previously known for this problem. In fact, finding any even…

Data Structures and Algorithms · Computer Science 2021-11-05 Andreas Björklund , Thore Husfeldt , Petteri Kaski

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…

Combinatorics · Mathematics 2017-10-10 L. Wang , S. Lu , H. Cao

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

Information Theory · Computer Science 2019-05-01 Minghui Yang , Lulu Zhang , Keqin Feng

We derive a semiclassical expression for an energy smoothed autocorrelation function defined on a group of eigenstates of the Schr\"odinger equation. The system we considered is an energy-conserved Hamiltonian system possessing…

Chaotic Dynamics · Physics 2009-11-07 Baowen Li , Daniel C Rouben

In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult…

Information Theory · Computer Science 2023-01-13 Janez Brest , Borko Bošković

Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…

Information Theory · Computer Science 2021-12-30 Jonathan M. Castello , Daniel J. Katz , Jacob M. King , Alain Olavarrieta

In this paper we show that a quasi-exactly solvable (normalizable or periodic) one-dimensional Hamiltonian satisfying very mild conditions defines a family of weakly orthogonal polynomials which obey a three-term recursion relation. In…

High Energy Physics - Theory · Physics 2009-10-30 Federico Finkel , Artemio Gonzalez-Lopez , Miguel A. Rodriguez

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…

Information Theory · Computer Science 2024-02-05 Stefka Bouyuklieva

Constant amplitude zero auto-correlation (CAZAC) sequences are widely applied in waveforms for radar and communication systems. Motivated by a recent work [Berggren and Popovi\'c, IEEE Trans. Inf. Theory 70(8), 6068-6075 (2024)], this paper…

Information Theory · Computer Science 2026-01-21 Qin Yuan , Chunlei Li , Xiangyong Zeng

Fourth-order many-body corrections to matrix elements for atoms with one valence electron are derived. The obtained diagrams are classified using coupled-cluster-inspired separation into contributions from n-particle excitations from the…

Atomic Physics · Physics 2009-11-07 Andrei Derevianko , Erik D. Emmons

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that remove a single vertex. Moreover, we give a cubic time…

Discrete Mathematics · Computer Science 2016-02-16 Martin Grohe

This work is motivated by the long-standing open problem of designing asymptotically order-optimal aperiodic polyphase sequence sets with respect to the celebrated Welch bound. Attempts were made by Mow over 30 years ago, but a…

Information Theory · Computer Science 2026-01-26 Huaning Liu , Zilong Liu

We study discrete conjugate nets whose Laplace sequence is of period four. Corresponding points of opposite nets in this cyclic sequence have equal osculating planes in different net directions, that is, they correspond in an asymptotic…

Differential Geometry · Mathematics 2012-04-13 Hans-Peter Schröcker

A fundamental problem is to understand why quantum theory only violates some noncontextuality (NC) inequalities and identify the physical principles that prevent higher-than-quantum violations. We prove that quantum theory only violates…

Quantum Physics · Physics 2013-09-12 Adan Cabello , Lars Eirik Danielsen , Antonio J. Lopez-Tarrida , Jose R. Portillo

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

Information Theory · Computer Science 2019-03-27 Martino Borello , Cem Güneri , Elif Saçıkara , Patrick Solé

A new flipped $SU(3)_C\otimes SU(4)_L\otimes U(1)_X$ model without exotic electric charges is proposed. All the quarks families are arranged in the same representation while leptons generations are in different representations leading to a…

High Energy Physics - Phenomenology · Physics 2021-07-19 Meriem Djouala , Noureddine Mebarki , Habib Aissaoui

In this paper, we investigate three-term linear relations among theta series of positive-definite integral binary quadratic forms. We extend Schiemann's methods to characterize all possible three-term linear relations among theta series of…

Number Theory · Mathematics 2023-07-04 Rahul Saha , Jonathan Hanke

An even (respectively, odd) hole in a graph is an induced cycle with even (respectively, odd) length that is at least four. Bienstock [DM 1991 and 1992] proved that detecting an even (respectively, odd) hole containing a given vertex is…

Data Structures and Algorithms · Computer Science 2022-01-06 Hou-Teng Cheong , Hsueh-I Lu
‹ Prev 1 4 5 6 7 8 10 Next ›