English
Related papers

Related papers: Construction of Optimal Binary Z-Complementary Cod…

200 papers

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

One of the important applications of Golay complementary sets (GCSs) is the reduction of peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. OFDM has played a major role in modern wireless…

Information Theory · Computer Science 2025-01-06 Abhishek Roy , Sudhan Majhi , Subhabrata Paul

A $(k+r,k,l)$ binary array code of length $k+r$, dimension $k$, and sub-packetization $l$ is composed of $l\times(k+r)$ matrices over $\mathbb{F}_2$, with every column of the matrix stored on a separate node in the distributed storage…

Information Theory · Computer Science 2025-11-13 Lan Ma , Qifu Tyler Sun , Shaoteng Liu , Liyang Zhou

The problem of three-user multiple-access channel (MAC) with noiseless feedback is investigated. A new coding strategy is presented. The coding scheme builds upon the natural extension of the Cover-Leung (CL) scheme; and uses quasi-linear…

Information Theory · Computer Science 2017-02-21 Mohsen Heidari , Farhad Shirani , S. Sandeep Pradhan

Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied,…

Information Theory · Computer Science 2011-10-10 Denis S. Krotov , Patric R. J. Östergård , Olli Pottonen

Quasi-complementary sequence sets (QCSSs) have attracted sustained research interests for simultaneously supporting more active users in multi-carrier code-division multiple-access (MC-CDMA) systems compared to complete complementary codes…

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

The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic…

Information Theory · Computer Science 2010-12-10 M. Heidari Khoozani , A. Rashidinejad , M. H. Lotfi Froushani , P. Pad , F. Marvasti

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to…

Information Theory · Computer Science 2013-05-02 Cunsheng Ding , Tor Helleseth

This paper is devoted to sequences and focuses on designing new two-dimensional (2-D) Z-complementary array pairs (ZCAPs) by exploring two promising approaches. A ZCAP is a pair of 2-D arrays, whose 2-D autocorrelation sum gives zero value…

Information Theory · Computer Science 2021-07-27 Hui Zhang , Cuiling Fan , Sihem Mesnager

Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…

Information Theory · Computer Science 2024-12-20 Guodong Wang , Shengwei Liu , Hongwei Liu

Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA [1]. In [1], a Maximum…

Information Theory · Computer Science 2010-01-26 Ali Mousavi , Pedram Pad , Farokh Marvasti

This paper aims to search for new optimal and sub-optimal Odd Binary Z-Complimentary Pairs (OBZCPs) for lengths up to 49. As an alternative to the celebrated binary Golay complementary pairs, optimal OBZCPs are the best almost-complementary…

Information Theory · Computer Science 2024-11-14 Peter Kazakov , Zilong Liu

Locally repairable codes (LRCs), which can recover any symbol of a codeword by reading only a small number of other symbols, have been widely used in real-world distributed storage systems, such as Microsoft Azure Storage and Ceph Storage…

Information Theory · Computer Science 2023-10-17 Wenqin Zhang , Deng Tang , Chenhao Ying , Yuan Luo

Recently a construction of optimal non-constant dimension subspace codes, also termed projective space codes, has been reported in a paper of Honold-Kiermaier-Kurz. Restricted to binary codes in a 5-dimensional ambient space with minimum…

Information Theory · Computer Science 2017-01-26 Anirban Ghatak

In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be…

Information Theory · Computer Science 2008-10-18 P. Pad , F. Marvasti , K. Alishahi , S. Akbari

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

Zero correlation zone (ZCZ) sequences and Golay complementary sequences are two kinds of sequences with different preferable correlation properties. Golay-ZCZ sequences are special kinds of complementary sequences which also possess a large…

Information Theory · Computer Science 2021-12-17 Zhi Gu , Zhengchun Zhou , Avik Ranjan Adhikary , Yanghe Feng , Pingzhi Fan

There exists a large literature of construction of convolutional codes with maximal or near maximal free distance. Much less is known about constructions of convolutional codes having optimal or near optimal column distances. In this paper,…

Information Theory · Computer Science 2023-05-26 Zita Abreu , Julia Lieb , Joachim Rosenthal

Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing…

Information Theory · Computer Science 2010-11-03 Mireille Sarkiss , Ghaya Rekaya-Ben Othman , Mohamed Oussama Damen , Jean-Claude Belfiore

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

Information Theory · Computer Science 2015-09-18 Hojjat Mostafanasab