Related papers: Uncorrelated binary sequences of lengths 2a3b4c5d7…
Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in…
Primary users (PU) separation concerns with the issues of distinguishing and characterizing primary users in cognitive radio (CR) networks. We argue the need for PU separation in the context of collaborative spectrum sensing and monitor…
We suggest a method for generation of random binary sequences with prescribed correlation properties. It is based on a kind of modification of the widely used convolution method of constructing continuous random processes. Apart from the…
We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signaling assistance does not change the capacity of classical…
Binary similarity detection is a critical technique that has been applied in many real-world scenarios where source code is not available, e.g., bug search, malware analysis, and code plagiarism detection. Existing works are ineffective in…
In spectrum sharing networks, a base station (BS) needs to mitigate the interference to users associated with other coexisting network in the same band. The BS can achieve this by transmitting its downlink signal in the null space of…
Low-discrepancy sequences have seen widespread adoption in computer graphics thanks to their superior convergence rates. Since rendering integrals often comprise products of lower-dimensional integrals, recent work has focused on developing…
The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…
In this work, a classical problem of the digital sequence design, or more precisely, finding binary sequences with optimal peak sidelobe level (PSL), is revisited. By combining some of our previous works, together with some mathematical…
We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables. Previous bounds in the literature were derived by applying…
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…
Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…
Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…
Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the…
Analogously to de Bruijn sequences, Orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., recursive…
Like other pseudorandom sequences, decimal sequences may be used in designing a Code Division Multiple Access (CDMA) system. They appear to be ideally suited for this since the cross-correlation of d-sequences taken over the LCM of their…
Complete complementary codes (CCCs) are highly valuable in the fields of information security, radar and communication. The spectrally null constrained (SNC) problem arises in radar and modern communication systems due to the reservation or…
The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…
In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a…
This paper proposes a novel joint non-binary network-channel code for the Time-Division Decode-and-Forward Multiple Access Relay Channel (TD-DF-MARC), where the relay linearly combines -- over a non-binary finite field -- the coded…