English
Related papers

Related papers: Set Size Bound for Aperiodic Z-Complementary Sets

200 papers

This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end and tail-end shifts. CZCSS can be regarded as an extension of…

Information Theory · Computer Science 2022-07-07 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…

Information Theory · Computer Science 2023-02-23 Gobinda Ghosh , Sudhan Majhi , Shubabrata Paul

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Combinatorics · Mathematics 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

This paper introduces a novel class of code sets, called "symmetrical Z-complementary code sets (SZCCSs)" , whose aperiodic auto- and cross- correlation sums exhibit zero-correlation zones (ZCZs) at both the front-end and tail-end of the…

Information Theory · Computer Science 2022-03-28 Yajing Zhou , Zhengchun Zhou , Zilong Liu , Yang Yang , Ping Yang , Pingzhi Fan

The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for…

Information Theory · Computer Science 2021-09-29 Gaojun Luo , Martianus Frederic Ezerman , San Ling

This paper aims to construct optimal Z-complementary code set (ZCCS) with non-power-of-two (NPT) lengths to enable interference-free multicarrier code-division multiple access (MC-CDMA) systems. The existing ZCCSs with NPT lengths, which…

Information Theory · Computer Science 2021-04-21 Palash Sarkar , Sudhan Majhi , Zilong Liu

We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the same proof we get a sharp upper bound for the…

Combinatorics · Mathematics 2020-05-04 Luca Studer

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

Combinatorics · Mathematics 2014-07-18 Giovanni Felici , Sokol Ndreca , Aldo Procacci , Benedetto Scoppola

Let $G$ be an abelian group. A set $A \subset G$ is a \emph{$B_k^+$-set} if whenever $a_1 + \dots + a_k = b_1 + \dots + b_k$ with $a_i, b_j \in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a…

Combinatorics · Mathematics 2013-06-21 Craig Timmons

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

Generalized spatial modulation (GSM) is a novel multiple-antenna technique offering flexibility among spectral efficiency, energy efficiency, and the cost of RF chains. In this paper, a novel class of sequence sets, called enhanced cross…

Information Theory · Computer Science 2023-12-04 Zhen-Ming Huang , Cheng-Yu Pai , Zilong Liu , Chao-Yu Chen

While conformal predictors reap the benefits of rigorous statistical guarantees on their error frequency, the size of their corresponding prediction sets is critical to their practical utility. Unfortunately, there is currently a lack of…

Machine Learning · Statistics 2024-03-12 Guneet S. Dhillon , George Deligiannidis , Tom Rainforth

Perfect complementary sequence sets (PCSSs) are widely used in multi-carrier code-division multiple-access (MC-CDMA) communication systems. However, the set size of a PCSS is upper bounded by the number of row sequences of each…

Information Theory · Computer Science 2024-12-03 Ziling Heng , Peng Wang , Chunlei Xie , Haiyan Zhou

This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z-complementary pair (CZCP). The maximum possible ZCZ width…

Information Theory · Computer Science 2022-07-26 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

Commutative Algebra · Mathematics 2023-10-17 Shalom Eliahou , Eshita Mazumdar

A periodic geodesic on a surface has a natural lift to the unit tangent bundle; when the complement of this lift is hyperbolic, its volume typically grows as the geodesic gets longer. We give an upper bound for this volume which is linear…

Geometric Topology · Mathematics 2016-05-11 Maxime Bergeron , Tali Pinsky , Lior Silberman

Mutually orthogonal complementary sets (MOCSs) have received significant research attention in recent years due to their wide applications in communications and radar. Existing MOCSs which are constructed based on generalized Boolean…

Information Theory · Computer Science 2020-03-17 Shing-Wei Wu , Chao-Yu Chen , Zilong Liu

Mutually orthogonal complementary sets (MOCSs) and Z-complementary code sets (ZCCSs) have many applications in practical scenarios such as synthetic aperture imaging systems and multi-carrier code division multiple access (MC-CDMA) systems.…

Information Theory · Computer Science 2023-08-10 Hongyang Xiao , Xiwang Cao

This paper presents a direct construction of an optimal symmetrical Z-complementary code set (SZCCS) of prime power lengths using a multi-variable function (MVF). SZCCS is a natural extension of the Z-complementary code set (ZCCS), which…

Information Theory · Computer Science 2023-05-03 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

Z-complementary code set (ZCCS) are well known to be used in multicarrier code-division multiple access (MCCDMA) system to provide a interference free environment. Based on the existing literature, the direct construction of optimal ZCCSs…

Information Theory · Computer Science 2022-04-20 Gobinda Ghosh , Sudhan Majhi , Palash Sarkar , Ashish Kumar Upadhyay
‹ Prev 1 2 3 10 Next ›