Related papers: New Sequences Design from Weil Representation with…
In this paper we construct a new variant of the Weil representation, associated with a symplectic vector space V defined over a finite field of characteristic two. Our variant is a representation of a bigger group than that of Weil. In the…
Comparing time series is essential in various tasks such as clustering and classification. While elastic distance measures that allow warping provide a robust quantitative comparison, a qualitative comparison on top of them is missing.…
For a real sequence of length of m = nl, we may deduce its congruence derivative sequence with length of l. The discrete Fourier transform of original sequence can be calculated by the discrete Fourier transform of the congruence derivative…
Construction of signal sets with low correlation property is of interest to designers of CDMA systems. One of the preferred ways of constructing such sets is the interleaved construction which uses two sequences a and b with 2-level…
The classical construction of the Weil representation, with complex coefficients, has long been expected to work for more general coefficient rings. This paper exhibits the minimal ring $\mathcal{A}$ for which this is possible, the integral…
Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…
We develop a simple algebraic approach to the study of the Weil representation associated to a finite abelian group. As a result, we obtain a simple proof of a generalisation of a well-known formula for the absolute value of its character.…
Boolean functions and binary sequences are main tools used in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary sequences with period a power of two. We establish a…
Let F be a local field. In the case of F being the real field, Pierre Cartier constructed Heisenberg-Weil representations of a Heisenberg group in families using non-self-dual lattices. This result was later reformulated by Jae-Hyun Yang in…
We develop a reduction theory for the representation of $\mathrm{SL}_n$ on pairs of symmetric $n\times n$ matrices. We apply this theory to the pencils of quadrics arising from divisors on hyperelliptic curves. We use these results to show…
Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…
The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are…
In this work we extend analytic signal theory to the multidimensional case when oscillations are observed in the $d$ orthogonal directions. First it is shown how to obtain separate phase-shifted components and how to combine them into…
We describe the image of general families of two-dimensional representations over compact semi-local rings. Applying this description to the family carried by the universal Hecke algebra acting on the space of modular forms of level $N$…
Suppose that $M$ is an even lattice with dual $M^{*}$ and level $N$. Then the group $Mp_{2}(\mathbb{Z})$, which is the unique non-trivial double cover of $SL_{2}(\mathbb{Z})$, admits a representation $\rho_{M}$, called the Weil…
We give a dynamical construction of an infinite sequence of distinct totally $p$-adic algebraic numbers whose Weil heights tend to the limit $\frac{\log p}{p-1}$, thus giving a new proof of a result of Bombieri-Zannier. The proof is…
We construct explicit local systems on the affine line in characteristic $p>2$, whose geometric monodromy groups are the finite symplectic groups $Sp_{2n}(q)$ for all $n \ge 2$, and others whose geometric monodromy groups are the special…
We construct Weil numbers corresponding to genus-2 curves with $p$-rank 1 over the finite field $\F_{p^2}$ of $p^2$ elements. The corresponding curves can be constructed using explicit CM constructions. In one of our algorithms, the group…
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In general, it is difficult to give both the linear complexity and…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…