English
Related papers

Related papers: New Constructions of Complementary Sequence Pairs …

200 papers

Quadrature amplitude modulation (QAM), deployed in billions of communication devises, exhibits a shaping-loss of $\pi \mathrm{e}/6$ ($\approx 1.53$ dB) compared to the Shannon-Hartley theorem. With inspiration gained from special (leaf,…

Information Theory · Computer Science 2017-08-25 Peter Larsson

Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…

Information Theory · Computer Science 2020-10-22 Avik Ranjan Adhikary , Yanghe Feng , Zhengchun Zhou , Pingzhi Fan

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Combinatorics · Mathematics 2009-01-06 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

This work is concerned with the fundamental scaling laws of quasi-complementary sequence sets (QCSSs) by understanding how large the set size (denoted by $M$) can grow with the flock size ($K$) and the sequence length ($N$). We first…

Combinatorics · Mathematics 2026-04-16 Huaning Liu , Lirong Guo , Zilong Liu

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

Inspired by the recent work of El Bachraoui, we present some new $q$-supercongruences on triple and quadruple sums of basic hypergeometric series. In particular, we give a $q$-supercongruence modulo the fifth power of a cyclotomic…

Number Theory · Mathematics 2022-03-22 Xiaoxia Wang , Chang Xu

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

Compared with the perfect complementary sequence sets, quasi-complementary sequence sets (QCSSs) can support more users to work in multicarrier CDMA communications. A near-optimal periodic QCSS is constructed in this paper by using an…

Information Theory · Computer Science 2017-07-18 Yu Li , Tongjiang Yan , Chuan Lv

We generalise the Gaussian formalism of Continuous Variable (CV) systems to describe their interactions with qubits/qudits that result in quantum superpositions of Gaussian processes. To this end, we derive a new set of equations in closed…

Quantum Physics · Physics 2025-10-02 Lorenzo Braccini , Sougato Bose , Alessio Serafini

We extend the paraunitary (PU) theory for complementary pairs to comple- mentary sets and complete complementary codes (CCC) by proposing a new PU construction. A special, but very important case of complementary sets (and CC- C), based on…

Information Theory · Computer Science 2018-08-31 Srdjan Z. Budisin

In the present paper we construct normal numbers in base $q$ by concatenating $q$-ary expansions of pseudo polynomials evaluated at the primes. This extends a recent result by Tichy and the author.

Number Theory · Mathematics 2014-12-11 Manfred G. Madritsch

We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…

Numerical Analysis · Mathematics 2024-04-25 Sergio Blanes , Fernando Casas , Luke Shaw

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2015-11-06 Baokun Ding , Tao Zhang , Gennian Ge

We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…

Number Theory · Mathematics 2019-02-25 Victor J. W. Guo , Michael J. Schlosser

3-phase Golay sequence and array triads are a natural generalisation of 2-phase Golay sequence pairs, yet their study has until now been largely neglected. We present exhaustive search results for 3-phase Golay sequence triads for all…

Combinatorics · Mathematics 2019-10-15 Aki Ayukawa Avis , Jonathan Jedwab

Quaternary sequences of both even and odd period having low autocorrelation are studied. We construct new families of balanced quaternary sequences of odd period and low autocorrelation using cyclotomic classes of order eight, as well as…

Combinatorics · Mathematics 2017-11-08 Jerod Michel , Qi Wang

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Information Theory · Computer Science 2023-06-28 Minjia Shi , Denis Krotov , Patrick Solé

Based on good algebraic structures and practicabilities, generalized quasi-cyclic (GQC) codes play important role in coding theory. In this paper, we study some results on GQC codes over $\mathbb{Z}_4$ including the normalized generating…

Rings and Algebras · Mathematics 2022-03-24 Jian Gao , Xiangrui Meng , Fang-Wei Fu

We present new constructions for perfect and odd perfect sequences over the quaternion group $Q_8$. In particular, we show for the first time that perfect and odd perfect quaternion sequences exist in all lengths $2^t$ for $t\geq0$. In…

Information Theory · Computer Science 2020-11-26 Curtis Bright , Ilias Kotsireas , Vijay Ganesh

Chvatal-Gomory (CG) cuts and the Bienstock-Zuckerberg hierarchy capture useful linear programs that the standard bounded degree Lasserre/Sum-of-Squares SOS hierarchy fails to capture. In this paper we present a novel polynomial time SOS…

Optimization and Control · Mathematics 2019-12-24 Monaldo Mastrolilli