English
Related papers

Related papers: A Construction of Arbitrarily Large Type-II $Z$ Co…

200 papers

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

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction.…

Information Theory · Computer Science 2024-11-12 Chaofeng Guan , Jingjie Lv , Gaojun Luo , Zhi Ma

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

In recent years, traditional zero-correlation zone (ZCZ) sequences are being studied due to support interference-free quasi-synchronous code division multiple access (QS-CDMA) systems. However, in cognitive radio (CR) network, it is…

Information Theory · Computer Science 2023-09-06 Nishant Kumar , Palash Sarkar , Sudhan Majhi

Recently established connection between additive codes and Narain CFTs provides a new tool to construct theories with special properties and solve modular bootstrap constraints by reducing them to algebraic identities. We generalize…

High Energy Physics - Theory · Physics 2022-11-30 Nikolaos Angelinos , Debarghya Chakraborty , Anatoly Dymarsky

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

In this paper, we study the algebraic structure of Z_2[u]Z_2[u, v]-additive codes which are Z_2[u, v]-submodules where u^2 = v^2 = 0 and uv = vu. In particular, we determine a Gray map from Z_2[u]Z_2 [u, v] to Z_2^{2{\alpha}+8\b{eta}} and…

Information Theory · Computer Science 2016-01-20 N. Annamalai , C. Durairajan

In this work, we study codes generated by elements that come from group matrix rings. We present a matrix construction which we use to generate codes in two different ambient spaces: the matrix ring $M_k(R)$ and the ring $R,$ where $R$ is…

Information Theory · Computer Science 2021-02-02 Steven Dougherty , Adrian Korban , Serap Sahinkaya , Deniz Ustun

MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…

Information Theory · Computer Science 2025-04-03 Weirong Meng , Weijun Fang , Fang-Wei Fu , Haiyan Zhou , Ziyi Gu

A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums (AACSs) for time-shifts within a certain region, called zero correlation zone (ZCZ). Optimal odd-length binary ZCPs (OB-ZCPs) display…

Information Theory · Computer Science 2019-09-24 Avik Ranjan Adhikary , Sudhan Majhi , Zilong Liu , Yong Liang Guan

Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…

Information Theory · Computer Science 2023-12-22 Canze Zhu , Qunying Liao , Haibo Liu

We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…

Commutative Algebra · Mathematics 2008-11-26 Adam Hughes , JohnMark Lau , Eric Peterson

In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers $X(D)$ and $Z(D)$ that commute (symplectic…

Information Theory · Computer Science 2026-02-17 Vahid Nourozi , David Mitchell

Building upon the work of Berglund (2018), we establish a method for constructing subsets $B \subseteq \mathbb{Z}_{mk}$ such that $B$ does not contain any $k$-term cyclic arithmetic progressions mod $mk$, where $m,k \in \mathbb{Z}^+$ with…

Combinatorics · Mathematics 2025-09-19 Benjamin Liber

We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…

Information Theory · Computer Science 2026-05-22 Prachi Mishra , Sidharth Jaggi , Navin Kashyap , Michael Langberg

A combinatorial formula to generate U(N) character expansions is presented. It is shown that the resulting character expansion formulas greatly simplify a number of problems where integrals over the group manifolds need to be calculated.…

High Energy Physics - Theory · Physics 2009-10-31 A. B. Balantekin

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

A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal…

Information Theory · Computer Science 2013-12-10 Vladimir D. Tonchev

We propose a full-rate iterated space-time code construction, to design 2n-dimensional codes from n-dimensional cyclic algebra based codes. We give a condition to determine whether the resulting codes satisfy the full-diversity property,…

Information Theory · Computer Science 2013-03-12 Nadya Markin , Frederique Oggier

Zero correlation zone (ZCZ) sequences and Golay sequences are two kinds of sequences with different preferable correlation properties. It was shown by Gong \textit{et al.} and Chen \textit{et al.} that some Golay sequences also possess a…

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