Related papers: New Sets of Optimal Odd-length Binary Z-Complement…
In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…
Complex-valued periodic sequences, u, constructed by Goran Bjorck, are analyzed with regard to the behavior of their discrete periodic narrow-band ambiguity functions A_p(u). The Bjorck sequences, which are defined on Z/pZ for p>2 prime,…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
Open clusters (OCs) in our Galaxy can be found in pairs, possibly forming physical binaries, or in groups. These objects offer unique insights into the process of star formation and testify to the dynamical interactions at local and…
Suffix arrays and LCP arrays are one of the most fundamental data structures widely used for various kinds of string processing. We consider two problems for a read-only string of length $N$ over an integer alphabet $[1, \dots, \sigma]$ for…
The All-Pairs Shortest Paths (APSP) is a foundational problem in theoretical computer science. Approximating APSP in undirected unweighted graphs has been studied for many years, beginning with the work of Dor, Halperin and Zwick…
Low correlation (finite length) sequences are used in communications and remote sensing. One seeks codebooks of sequences in which each sequence has low aperiodic autocorrelation at all nonzero shifts, and each pair of distinct sequences…
We develop and test efficient approximations to estimate ground state correlations associated with low- and zero-energy modes. The scheme is an extension of the generator-coordinate-method (GCM) within Gaussian overlap approximation (GOA).…
Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…
This paper presents a new class of sparse superposition codes for low-rates and short-packet communications over the additive white Gaussian noise channel. The new code is orthogonal sparse superposition (OSS) code. A codeword of OSS codes…
Three different special quasirandom structures (SQS) of the substitutional hcp $A_{1-x}B_x$ binary random solutions ($x=0.25$, 0.5, and 0.75) are presented. These structures are able to mimic the most important pair and multi-site…
This paper presents a novel approach to address the constrained coding challenge of generating almost-balanced sequences. While strictly balanced sequences have been well studied in the past, the problem of designing efficient algorithms…
A pair $(C, D)$ of group codes over group algebra $R[G]$ is called a linear complementary pair (LCP) if $C \oplus D =R[G]$, where $R$ is a finite principal ideal ring, and $G$ is a finite group. We provide a necessary and sufficient…
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…
Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying…
Sequences with low aperiodic autocorrelation and crosscorrelation are used in communications and remote sensing. Golay and Shapiro independently devised a recursive construction that produces families of complementary pairs of binary…
We construct a family of infinitely many new candidate non-Abelian self-correcting topological quantum memories in $D\geq 5+1$ spacetime dimensions without particle excitations using local commuting non-Pauli stabilizer lattice models and…
Pursley and Sarwate established a lower bound on a combined measure of autocorrelation and crosscorrelation for a pair $(f,g)$ of binary sequences (i.e., sequences with terms in $\{-1,1\}$). If $f$ is a nonzero sequence, then its…
The subject of this paper is transmission over a general class of binary-input memoryless symmetric channels using error correcting codes based on sparse graphs, namely low-density generator-matrix and low-density parity-check codes. The…
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,…