This paper proposes a simple detection scheme for a single carrier block transmission (SCBT) without guard interval (GI). Although the SCBT without the GI can significantly increase bandwidth efficiency, the received signal suffers from interblock interference (IBI) and inter-symbol interference (ISI), which cannot be effectively equalized by a frequency domain equalizer (FDE). In the proposed ...

In this paper, we gives an upper bound estimation of the spectral norm for matrices A and B such that the entries in the first row of n×n r-circulant matrix A = Circr(a1, a2, . . . , an) and n×n symmetric r-circulant matrix B = SCircr(a1, a2, . . . , an) are ai = Pi or ai = P 2 i or ai = Pi−1 or ai = P 2 i−1, where {Pi}i=0 is Padovan sequence. At the last section, some illustrative numerical ex...

We present a way to physically realize a circulant 2-qubit entangling gate in the Kauffman-Jones version of SU(2) Chern-Simons theory at level 4. Our approach uses qubit and qutrit ancillas, braids, fusions and interferometric measurements. Our qubit is formed by four anyons of topological charges 1221. Among other 2qubit entangling gates we generate in the present work, we produce in particula...

For simplicity, we adopt the following convention: i, j, k, n, l denote elements of N, K denotes a field, a, b, c denote elements of K, p, q denote finite sequences of elements of K, and M1, M2, M3 denote square matrices over K of dimension n. Next we state two propositions: (1) 1K · p = p. (2) (−1K) · p = −p. Let K be a set, let M be a matrix over K, and let p be a finite sequence. We say that...

A classification of all extremal double circulant self-dual codes of lengths up to 72 is known. In this paper, we give a classification of all extremal double circulant self-dual codes of lengths 74–88. © 2006 Elsevier B.V. All rights reserved.

In this paper we completely classify the circulant weighing matrices of weight 16 and odd order. It turns out that the order must be an odd multiple of either 21 or 31. Up to equivalence, there are two distinct matrices in CW (31, 16), one matrix in CW (21, 16) and another one in CW (63, 16) (not obtainable by Kronecker product from CW (21, 16)). The classification uses a multiplier existence t...

We disprove the following conjecture due to Vı́ctor Neumann-Lara: for every pair (r, s) of integers such that r > s > 2, there is an infinite set of circulant tournaments T such that the dichromatic number and the cyclic triangle free disconnection of T are equal to r and s, respectively. Let Fr,s denote the set of circulant tournaments T with dc(T ) = r and − →ω 3 (T ) = s. We show that for eve...

The use of amicable sets of eight circulant matrices and four negacyclic matrices to generate orthogonal designs is relatively new. We find all 1841 possible orthogonal designs of order 40 in three variables, using only these new techniques.