English
Related papers

Related papers: Constructions of Optimal and Near-Optimal Quasi-Co…

200 papers

In this paper, we employ the so-called semi-bent functions to achieve significant improvements over currently known methods regarding the number of orthogonal sequences per cell that can be assigned to a regular tessellation of hexagonal…

Information Theory · Computer Science 2016-05-18 WeiGuo Zhang , ChunLei Xie , Enes Pasalic

The sum capacity on a symbol-synchronous CDMA system having processing gain $N$ and supporting $K$ power constrained users is achieved by employing at most $2N-1$ sequences. Analogously, the minimum received power (energy-per-chip) on the…

Information Theory · Computer Science 2008-02-27 Rajesh Sundaresan , Arun Padakandla

This paper presents two methods for approximating the performance of coded multicarrier systems operating over frequency-selective, quasi-static fading channels with non-ideal interleaving. The first method is based on approximating the…

Information Theory · Computer Science 2007-07-13 C. Snow , L. Lampe , R. Schober

Z-complementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of two-dimensional matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for…

Information Theory · Computer Science 2019-11-11 Palash Sarkar , Sudhan Majhi , Zilong Liu

Polynomial dynamical systems (DSs) can model a wide range of physical processes. A special subset of these DSs that can model chemical reactions under mass-action kinetics is called chemical dynamical systems (CDSs). A fundamental problem,…

Molecular Networks · Quantitative Biology 2025-08-04 Tomislav Plesa

A simple and general definition of quasi cyclic low density parity check (QC LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of…

Information Theory · Computer Science 2017-01-24 A. Tasdighi , M. R. Sadeghi

Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…

Information Theory · Computer Science 2014-11-12 Martianus Frederic Ezerman , Somphong Jitman , San Ling , Dmitrii V. Pasechnik

The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for…

Information Theory · Computer Science 2010-03-16 Chenggao Han , Naoki Suehiro , Takeshi Hashimoto

We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…

Information Theory · Computer Science 2024-08-27 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

In this paper, for the first time, we present a direct and new construction of multiple zero-correlation zone (ZCZ) sequence sets with inter-set zero-cross correlation zone (ZCCZ) from generalised Boolean function. Tang \emph{et al.} in…

Information Theory · Computer Science 2023-02-07 Nishant Kumar , Sudhan Majhi , Ashish K. Upadhyay

Periodic approximations of quasicrystals are a powerful tool in analyzing spectra of Schr\"odinger operators arising from quasicrystals, given the known theory for periodic crystals. Namely, we seek periodic operators whose spectra…

Dynamical Systems · Mathematics 2024-08-20 Lior Tenenbaum

Pseudorandom sequences with optimal three-level autocorrelation have important applications in CDMA communication systems. Constructing the sequences with three-level autocorrelation is equivalent to finding cyclic almost difference sets as…

Cryptography and Security · Computer Science 2016-03-01 Minglong Qi , Shengwu Xiong , Jinbgling Yuan , Wenbi Rao , Luo Zhong

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

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…

Information Theory · Computer Science 2026-05-25 Gustavo Terra Bastos , Angelynn Álvarez , Cameron Williams

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

Reconfigurable intelligent surfaces (RISs) can establish favorable wireless environments to combat the severe attenuation and blockages in millimeter-wave (mmWave) bands. However, to achieve the optimal enhancement of performance, the…

Information Theory · Computer Science 2022-03-02 Muxin He , Jindan Xu , Wei Xu , Hong Shen , Ning Wang , Chunming Zhao

Sets of sequences with good correlation properties are desired in many active sensing and communication systems, e.g., multiple-input-multiple-output (MIMO) radar systems and code-division multiple-access (CDMA) cellular systems. In this…

Optimization and Control · Mathematics 2016-05-04 Junxiao Song , Prabhu Babu , Daniel P. Palomar

Complete complementary codes (CCCs) play a vital role not only in wireless communication, particularly in multicarrier systems where achieving an interference-free environment is of paramount importance, but also in the construction of…

Information Theory · Computer Science 2024-03-25 Palash Sarkar , Chunlei Li , Sudhan Majhi , Zilong Liu

A new method to construct $q$-ary complementary sequence (or array) sets (CSSs) and complete complementary codes (CCCs) of size $N$ is introduced in this paper. An algorithm on how to compute the explicit form of the functions in…

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

Recent work on approximate quantum error correction (QEC) has opened up the possibility of constructing subspace codes that protect information with high fidelity in scenarios where perfect error correction is impossible. Motivated by this,…

Quantum Physics · Physics 2012-07-31 Prabha Mandayam , Hui Khoon Ng