English
Related papers

Related papers: A Direct Construction of Cross Z-Complementary Seq…

200 papers

It is shown that replacing the sinusoidal chip in Golay complementary code pairs by special classes of waveforms that satisfy two conditions, symmetry/anti-symmetry and quazi-orthogonality in the convolution sense, renders the complementary…

Information Theory · Computer Science 2017-09-06 Ravi Kadlimatti , Adly T. Fam

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

A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…

Combinatorics · Mathematics 2019-11-14 Daniel Heinlein

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Information Theory · Computer Science 2017-06-28 Long Yu , Xiusheng Liu

This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…

Combinatorics · Mathematics 2013-06-06 Aidan Roy

Strong Zero Modes (SZMs) are (approximately) conserved quantities that result in (approximate) double degeneracies in the entire spectra of certain Hamiltonians, with the Majorana zero mode of the transverse-field Ising chain being a…

Statistical Mechanics · Physics 2026-03-04 Sanjay Moudgalya , Olexei I. Motrunich

In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers $X(D)$ and $Z(D)$ that commute (symplectic…

Information Theory · Computer Science 2026-02-17 Vahid Nourozi , David Mitchell

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences…

Combinatorics · Mathematics 2014-01-23 Seth Pettie

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…

Information Theory · Computer Science 2022-02-25 Min Qiu , Xiaowei Wu , Jinhong Yuan , Alexandre Graell i Amat

Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size. In some cases, however,…

Data Structures and Algorithms · Computer Science 2020-04-10 Kotaro Matsuda , Shuhei Denzumi , Kunihiko Sadakane

Previously, we have presented a framework to use the para-unitary (PU) matrix-based approach for constructing new complementary sequence set (CSS), complete complementary code (CCC), complementary sequence array (CSA), and complete…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Dongxu Ma , Erzhong Xue , Guang Gong , Srdjan Budisin

In this paper, we first propose a new design strategy of 2D $Z$-complementary array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four distinct unimodular arrays satisfying zero 2D auto-correlation sums for non-trivial…

Information Theory · Computer Science 2023-08-15 Shibsankar Das , Adrish Banerjee , Udaya Parampalli

This paper gives a construction of group divisible designs on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which is motivated from the decoding of binary quadratic residue codes. A conjecture is proposed for…

Combinatorics · Mathematics 2017-01-02 Chong-Dao Lee , Yaotsu Chang , Chia-an Liu

Strong zero modes (SZMs) are edge-localized operators that commute with the Hamiltonian up to corrections exponentially small in system size, yielding anomalously long edge coherence times. In some settings, notably certain integrable…

Quantum Physics · Physics 2026-05-27 Sascha Gehrmann

Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…

Information Theory · Computer Science 2025-02-05 F. J. Lobillo , José Manuel Muñoz

Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…

Information Theory · Computer Science 2022-10-25 Lingfei Jin , Liming Ma , Chaoping Xing

The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a good candidate for RAID 6 because of its optimal storage efficiency, optimal update complexity, optimal length, and cyclic symmetry. In this paper, the underlying…

Information Theory · Computer Science 2015-03-19 Mingqiang Li , Jiwu Shu

Sequences with good correlation properties have been widely adopted in modern communications, radar and sonar applications. In this paper, we present our new findings on some constructions of single $H$-ary Golay sequence and $4^q$-QAM…

Information Theory · Computer Science 2011-06-24 Guang Gong , Fei Huo , Yang Yang

Linear intersection pairs of linear codes have become of interest due to their nice algebraic properties and wide applications. In this paper, we focus on linear intersection pairs of cyclic codes over finite fields. Some properties of…

Information Theory · Computer Science 2024-01-05 Somphong Jitman

We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.

Combinatorics · Mathematics 2022-06-02 Vsevolod F. Lev
‹ Prev 1 4 5 6 7 8 10 Next ›