English
Related papers

Related papers: A Direct Construction of Complete Complementary Co…

200 papers

Rate-compatible error-correcting codes (ECCs), which consist of a set of extended codes, are of practical interest in both wireless communications and data storage. In this work, we first study the lower bounds for rate-compatible ECCs,…

Information Theory · Computer Science 2017-05-22 Pengfei Huang , Yi Liu , Xiaojie Zhang , Paul H. Siegel , Erich F. Haratsch

It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear…

Quantum Physics · Physics 2025-10-09 Louis Golowich , Venkatesan Guruswami

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

Certain applications require the use of signals that combine both the capability to operate with low signal-to-noise ratios and the ability to support multiple users without interference. In the case where many users have very different…

Information Theory · Computer Science 2021-03-10 Patricio G. Donato , Matias N. Hadad , Marcos A. Funes

We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially-coupled low-density parity-check (SC-LDPC) codes. In CC…

Information Theory · Computer Science 2019-10-04 Pablo M. Olmos , David G. M. Mitchell , Dmitri Truhachev , Daniel J. Costello

A major drawback of orthogonal frequency division multiplexing (OFDM) systems is their high peak-to-mean envelope power ratio (PMEPR). The PMEPR problem can be solved by adopting large codebooks consisting of complementary sequences with…

Information Theory · Computer Science 2020-06-24 Palash Sarkar , Sudhan Majhi , Zilong Liu

In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such Cayley graph…

Combinatorics · Mathematics 2024-11-15 Sergey Goryainov , Denis Krotov

We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…

Discrete Mathematics · Computer Science 2017-11-02 Alexander M. Romanov

We introduce a new class of rate one-half binary codes: {\bf complementary information set codes.} A binary linear code of length $2n$ and dimension $n$ is called a complementary information set code (CIS code for short) if it has two…

Information Theory · Computer Science 2016-11-15 Claude Carlet , Philippe Gaborit , Jon-Lark Kim , Patrick Solé

Recently, rate-$1/\omega$ zero-terminated and tail-biting convolutional codes (ZTCCs and TBCCs) with cyclic-redundancy-check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short…

Information Theory · Computer Science 2022-06-09 Wenhui Sui , Hengjie Yang , Brendan Towell , Ava Asmani , Richard D. Wesel

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

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang

Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…

Information Theory · Computer Science 2019-10-24 Zilong Wang , Gaofei Wu , Dongxu Ma

In this paper, we propose a new method for constructing $1$-perfect mixed codes in the Cartesian product $\mathbb{F}_{n} \times \mathbb{F}_{q}^n$, where $\mathbb{F}_{n}$ and $\mathbb{F}_{q}$ are finite fields of orders $n = q^m$ and $q$. We…

Information Theory · Computer Science 2023-12-27 Alexander M. Romanov

We introduce generalized spatially coupled parallel concatenated codes (GSC-PCCs), a class of spatially coupled turbo-like codes obtained by coupling parallel concatenated codes (PCCs) with a fraction of information bits repeated before the…

Information Theory · Computer Science 2021-05-04 Min Qiu , Xiaowei Wu , Jinhong Yuan , Alexandre Graell i Amat

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

Constant amplitude zero autocorrelation (CAZAC) sequences have modulus one and ideal periodic autocorrelation function. Such sequences are used in cellular radio communications systems, e.g., for reference signals, synchronization signals…

Information Theory · Computer Science 2024-04-29 Fredrik Berggren , Branislav M. Popovic

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…

Algebraic Geometry · Mathematics 2024-12-31 Alonso S. Castellanos , Adler V. Marques , Luciane Quoos
‹ Prev 1 3 4 5 6 7 10 Next ›