English
Related papers

Related papers: New Construction of Z-Complementary Code Sets and …

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

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

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

In this study, we propose two schemes for uplink control channels based on non-contiguous complementary sequences (CSs) where the peak-to-average-power ratio (PAPR) of the resulting orthogonal frequency division multiplexing (OFDM) signal…

Information Theory · Computer Science 2019-04-03 Alphan Şahin , Rui Yang

Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…

Information Theory · Computer Science 2020-05-19 Ted Hurley

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

We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…

Information Theory · Computer Science 2024-05-30 Ferruh Ozbudak , Paolo Santonastaso , Ferdinando Zullo

We present a $N$-dimensional generalization of the two-dimensional block-circulant perfect array construction by \cite{Blake2013}. As in \cite{Blake2013}, the families of $N$-dimensional arrays possess pairwise \textit{good} zero…

Information Theory · Computer Science 2013-04-09 Samuel T. Blake

A new method for frequency synchronization based upon Zero-Intermediate Frequency Zero-IF receiver and characteristics of the received signal s power spectrum for MC-DSCDMA Up link system is proposed in this paper. In addition to this,…

Networking and Internet Architecture · Computer Science 2014-02-18 V. Karthikeyan , V. J. Vijayalakshmi

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

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

In this paper a novel family of codes for modified spectral-amplitude-coding optical code division multiple access (SAC-OCDMA) is introduced. The proposed codes exist for more number of processing gains comparing to the previously reported…

Information Theory · Computer Science 2010-09-24 Mohammad Noshad , Kambiz Jamshidi

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

In this letter, we analyze the performance of mixed coherent and non-coherent transmissions approach, which can improve the performance of cell-free multiple-input multiple-output orthogonal frequency division multiplexing (CF mMIMO-OFDM)…

Information Theory · Computer Science 2024-11-12 Guoyu Li , Shaochuan Wu , Changsheng You , Wenbin Zhang , Guanyu Shang

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

Constant dimension codes (CDCs) are essential for error correction in random network coding. A fundamental problem of CDCs is to determine their maximal possible size for given parameters. Inserting construction and multilevel construction…

Information Theory · Computer Science 2025-02-19 Han Li , Fang-Wei Fu

Protocol sequences are binary and periodic sequences used for deterministic multiple access in a collision channel without feedback. In this paper, we focus on user-irrepressible (UI) protocol sequences that can guarantee a positive…

Information Theory · Computer Science 2017-07-05 Yijin Zhang , Yuan-Hsun Lo , Kenneth W. Shum , Wing Shing Wong

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

Due to their widespread applications, linear complementary pairs (LCPs) have attracted much attention in recent years. In this paper, we determine explicit construction of non-special divisors of degree $g$ and $g-1$ on Kummer extensions…

Information Theory · Computer Science 2025-07-01 Huang Junjie , Chen Haojie , Zhang Huachao , Zhao Chang-An

One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…

Information Theory · Computer Science 2021-03-19 Xianmang He , Yindong Chen , Zusheng Zhang , Kunxiao Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›