English
Related papers

Related papers: A Direct Construction of 2D-CCC with Arbitrary Arr…

200 papers

Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…

Information Theory · Computer Science 2024-05-14 Tuvi Etzion

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

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…

Information Theory · Computer Science 2019-06-17 Homa Esfahanizadeh , Ruiyi Wu , Lara Dolecek

For a type-I $(K,M,Z,N)$-ZCCS, it follows $K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. In this paper, we propose a construction of type-II $(p^{k+n},p^k,p^{n+r}-p^r+1,p^{n+r})$-$Z$ complementary code set (ZCCS) using an extended…

Information Theory · Computer Science 2024-05-15 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

In this work, we study codebook designs for full-dimension multiple-input multiple-output (FD-MIMO) systems with a multi-panel array (MPA). We propose novel codebooks which allow precise beam structures for MPA FD-MIMO systems by…

Information Theory · Computer Science 2022-08-10 Zhilin Fu , Sangwon Hwang , Jihwan Moon , Haibao Ren , Inkyu Lee

In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most…

Information Theory · Computer Science 2022-08-22 Tuan Thanh Nguyen , Kui Cai , Han Mao Kiah , Kees A. Schouhamer Immink , Yeow Meng Chee

Designing a new class of rectangular two-dimensional sparse array to enhance the signal resolving capabilities with a limited number of sensors has always been a challenge. We explore the non-uniformity of the sparse arrays to enhance the…

Signal Processing · Electrical Eng. & Systems 2022-06-09 Kretika Goel , Monika Aggarwal , Subrat kar

Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs),…

Combinatorics · Mathematics 2019-11-06 Shuangqing Liu , Yanxun Chang , Tao Feng

A constant-amplitude code is a code that reduces the peak-to-average power ratio (PAPR) in multicode code-division multiple access (MC-CDMA) systems to the favorable value 1. In this paper quaternary constant-amplitude codes (codes over…

Information Theory · Computer Science 2009-09-24 Kai-Uwe Schmidt

In most multiple-input multiple-output (MIMO) communication systems, e.g., Massive MIMO, the antenna spacing is generally no less than half a wavelength. It helps to reduce the mutual coupling and therefore facilitate the system design. The…

Information Theory · Computer Science 2022-04-26 Liangcheng Han , Haifan Yin , Thomas L. Marzetta

The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean…

Information Theory · Computer Science 2020-02-19 Gaoxiang Wang , Avik Ranjan Adhikary , Zhengchun Zhou , Yang Yang

The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered in this correspondence. By generalizing a result by…

Information Theory · Computer Science 2016-11-17 Kai-Uwe Schmidt

Subspace codes, especially constant dimension subspace codes (CDCs), represent an intriguing domain that can be used to conduct basic coding theory investigations. They have received widespread attention due to their applications in random…

Information Theory · Computer Science 2025-08-06 Gang Wang , Xuan Gao , Sihem Mesnager , Fang-Wei Fu

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

This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by randomly allocating bits in a sparse parity-check matrix, over…

Combinatorics · Mathematics 2017-01-23 D. Donovan , A. Rao , E. Şule Yazıcı

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

Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…

Methodology · Statistics 2022-03-15 Yuanzhen He , C. Devon Lin , Fasheng Sun

Theoretically, the three-dimensional (3D) array architecture provides a higher communication degree of freedom (DoF) compared to the planar arrays, allowing for greater capacity potential in multiple-input multiple-output (MIMO) systems.…

Recent developments in storage -- especially in the area of resistive random access memory (ReRAM) -- are attempting to scale the storage density by regarding the information data as two-dimensional (2D), instead of one-dimensional (1D).…

Information Theory · Computer Science 2025-09-04 Viet Hai Le , Thanh Phong Pham , Tuan Thanh Nguyen , Kui Cai , Kees A. Schouhamer Immink

Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for MCWCs which yield several new infinite…

Information Theory · Computer Science 2014-11-11 Yeow Meng Chee , Han Mao Kiah , Hui Zhang , Xiande Zhang