Related papers: Doppler Tolerance, Complementary Code Sets and the…
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…
We consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the…
The Thue--Morse sequence $t=01101001\cdots$ is an automatic sequence over the alphabet $\{0,1\}$. It can be defined as the binary sum-of-digits function $s:\mathbb N\rightarrow\mathbb N$, reduced modulo $2$, or by using the substitution…
The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considered in this correspondence. By generalizing a result by…
Dense coding has been implemented using the generalized Grover's algorithm and its inverse operation. Exploiting the superpositions of two Einstein-Podolsky-Rosen (EPR) states, messages that are possible to be transmitted increase. Our…
We present new methods of generating Prouhet-Tarry-Escott partitions of arbitrarily large regularity. One of these methods generalizes the construction of the Thue-Morse sequence to finite alphabets with more than two letters. We show how…
Kirchhoff-type Laws for signed graphs are characterized by generalizing transpedances through the incidence-oriented structure of bidirected graphs. The classical $2$-arborescence interpretation of Tutte is shown to be equivalent to…
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded,…
Equivariant localization expresses global invariants in terms of local invariants, and many of them appearing in equivariant index theory, (holomorphic) Morse theory, geometric quantization and supersymmetric localization can be…
Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…
We construct a Continuous Wavelet Transform (CWT) on the torus $\mathbb T^2$ following a group-theoretical approach based on the conformal group $SO(2,2)$. The Euclidean limit reproduces wavelets on the plane $\mathbb R^2$ with two…
The complex method of interpolation, going back to Calder\'on and Coifman et al., on the one hand, and the Alexander-Wermer-Slodkowski theorem on polynomial hulls with convex fibers, on the other hand, are generalized to a method of…
In this paper I introduce modular symbols for Maass wave cusp forms. They appear in the guise of finitely additive functions on the Boolean algebra generated by intervals with non--positive rational ends, with values in analytic functions…
Summarizing basic facts from abstract topological modules over Colombeau generalized complex numbers we discuss duality of Colombeau algebras. In particular, we focus on generalized delta functionals and operator kernels as elements of dual…
We introduce an extended framework for the simultaneous gauging of modulated symmetries in $(d+1)$ dimensions, employing {\it multiple} gauge symmetry operators whose corresponding gauging procedures must be carried out simultaneously.…
One of the important applications of Golay complementary sets (GCSs) is the reduction of peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. OFDM has played a major role in modern wireless…
Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…
We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.
We prove a generalised Ramsey--Tur\'an theorem for matchings, which (a) simultaneously generalises the Cockayne--Lorimer Theorem (Ramsey for matchings) and the Erd\H{o}s--Gallai Theorem (Tur\'an for matchings), and (b) is a generalised…
We introduce a morphing procedure that can be used to generate new quantum codes from existing quantum codes. In particular, we morph the 15-qubit Reed-Muller code to obtain a $[\![10,1,2]\!]$ code that is the smallest known stabilizer code…